{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:49:46Z","timestamp":1743061786863,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36755-8_14","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T15:05:16Z","timestamp":1576508716000},"page":"214-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tracking Computability of\u00a0GPAC-Generable Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5474-3614","authenticated-orcid":false,"given":"Diogo","family":"Po\u00e7as","sequence":"first","affiliation":[]},{"given":"Jeffery","family":"Zucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jco.2006.12.005","volume":"23","author":"O Bournez","year":"2007","unstructured":"Bournez, O., Campagnolo, M.L., Gra\u00e7a, D.S., Hainry, E.: Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23(3), 317\u2013335 (2007). https:\/\/doi.org\/10.1016\/j.jco.2006.12.005","journal-title":"J. Complex."},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0016-0032(31)90616-9","volume":"212","author":"V Bush","year":"1931","unstructured":"Bush, V.: The differential analyzer. A new machine for solving differential equations. J. Frankl. Inst. 212(4), 447\u2013488 (1931)","journal-title":"J. Frankl. Inst."},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1006\/jcom.2000.0559","volume":"16","author":"ML Campagnolo","year":"2000","unstructured":"Campagnolo, M.L., Moore, C., Costa, J.F.: Iteration, inequalities, and differentiability in analog computers. J. Complex. 16(4), 642\u2013660 (2000). https:\/\/doi.org\/10.1006\/jcom.2000.0559","journal-title":"J. Complex."},{"key":"14_CR4","volume-title":"Theory of Ordinary Differential Equations","author":"EA Coddington","year":"1955","unstructured":"Coddington, E.A., Levinson, N.: Theory of Ordinary Differential Equations. Tata McGraw-Hill Education, New York (1955)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11494645_21","volume-title":"New Computational Paradigms","author":"DS Gra\u00e7a","year":"2005","unstructured":"Gra\u00e7a, D.S., Campagnolo, M.L., Buescu, J.: Robust simulations of turing machines with analytic maps and flows. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 169\u2013179. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11494645_21"},{"key":"14_CR6","volume-title":"Calculating Instruments and Machines","author":"DR Hartree","year":"1950","unstructured":"Hartree, D.R.: Calculating Instruments and Machines. Cambridge University Press, Cambridge (1950)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kohlenbach, U., Lambov, B.: Bounds on iterations of asymptotically quasi-nonexpansive mappings. BRICS Rep. Ser. 10(51) (2003)","DOI":"10.7146\/brics.v10i51.21823"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.4171\/JEMS\/190","volume":"12","author":"U Kohlenbach","year":"2010","unstructured":"Kohlenbach, U., Leu\u015ftean, L.: Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces. J. Eur. Math. Soc. 12(1), 71\u201392 (2010). https:\/\/doi.org\/10.4171\/JEMS\/190","journal-title":"J. Eur. Math. Soc."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"AI Mal\u2019cev","year":"1961","unstructured":"Mal\u2019cev, A.I.: Constructive algebras I. Rus. Math. Surv. 16, 77\u2013129 (1961)","journal-title":"Rus. Math. Surv."},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"MB Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.3233\/COM-170077","volume":"7","author":"D Po\u00e7as","year":"2018","unstructured":"Po\u00e7as, D., Zucker, J.: Analog networks on function data streams. Computability 7(4), 301\u2013322 (2018). https:\/\/doi.org\/10.3233\/COM-170077","journal-title":"Computability"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Po\u00e7as, D., Zucker, J.: Approximability in the GPAC. Log. Methods Comput. Sci. 15(3) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(3:24)2019","DOI":"10.23638\/LMCS-15(3:24)2019"},{"key":"14_CR13","volume-title":"Methods of Modern Mathematical Physics: Functional Analysis","author":"M Reed","year":"1980","unstructured":"Reed, M., Simon, B.: Methods of Modern Mathematical Physics: Functional Analysis. Academic Press Inc., Cambridge (1980)"},{"key":"14_CR14","series-title":"International Series in Pure and Applied Mathematics","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1976","unstructured":"Rudin, W.: Principles of Mathematical Analysis. International Series in Pure and Applied Mathematics, 3rd edn. McGraw-Hill, New York (1976)","edition":"3"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/sapm1941201337","volume":"20","author":"C Shannon","year":"1941","unstructured":"Shannon, C.: Mathematical theory of the differential analyser. J. Math. Phys. 20, 337\u2013354 (1941)","journal-title":"J. Math. Phys."},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1093\/oso\/9780198537809.003.0004","volume-title":"Effective algebras. Handbook of Logic in Computer Science","author":"V Stoltenberg-Hansen","year":"1995","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Effective algebras. Handbook of Logic in Computer Science, vol. 4, pp. 357\u2013526. Oxford University Press, Oxford (1995)"},{"issue":"1\u20132","key":"14_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00296-5","volume":"219","author":"V Stoltenberg-Hansen","year":"1999","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Concrete models of computation for topological algebras. Theoret. Comput. Sci. 219(1\u20132), 347\u2013378 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR18","first-page":"479","volume-title":"Treatise on Natural Philosophy","author":"W Thomson","year":"1880","unstructured":"Thomson, W., Tait, P.: Treatise on Natural Philosophy, 2nd edn, pp. 479\u2013508. Cambridge University Press, Cambridge (1880)","edition":"2"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/1024922.1024924","volume":"5","author":"JV Tucker","year":"2004","unstructured":"Tucker, J.V., Zucker, J.I.: Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Logic (TOCL) 5(4), 611\u2013668 (2004). https:\/\/doi.org\/10.1145\/1024922.1024924","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jlap.2003.10.001","volume":"62","author":"JV Tucker","year":"2005","unstructured":"Tucker, J.V., Zucker, J.I.: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. J. Logic Algebraic Program. 62(1), 71\u2013108 (2005). https:\/\/doi.org\/10.1016\/j.jlap.2003.10.001","journal-title":"J. Logic Algebraic Program."},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Tucker, J.V., Zucker, J.I.: Abstract versus concrete computability: the case of countable algebras. In: Stoltenberg-Hansen, V., V\u00e4\u00e4n\u00e4nen, J. (eds.) Logic Colloquium \u201903. Lecture Notes in Logic, pp. 377\u2013408. Cambridge University Press, Cambridge (2006). https:\/\/doi.org\/10.1017\/9781316755785.019","DOI":"10.1017\/9781316755785.019"},{"key":"14_CR22","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Texts in Theoretical Computer Science. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T18:15:02Z","timestamp":1722190502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}