{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T04:54:33Z","timestamp":1767156873576},"reference-count":33,"publisher":"Wiley","issue":"4-5","license":[{"start":{"date-parts":[[2004,8,18]],"date-time":"2004-08-18T00:00:00Z","timestamp":1092787200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper revisits one of the first models of analog computation, the General Purpose Analog Computer (GPAC). In particular, we restrict our attention to the improved model presented in [11] and we show that it can be further refined. With this we prove the following: (i) the previous model can be simplified; (ii) it admits extensions having close connections with the class of smooth continuous time dynamical systems. As a consequence, we conclude that some of these extensions achieve Turing universality. Finally, it is shown that if we introduce a new notion of computability for the GPAC, based on ideas from computable analysis, then one can compute transcendentally transcendental functions such as the Gamma function or Riemann's Zeta function. (\u00a9 2004 WILEY\u2010VCH Verlag GmbH &amp; Co. KGaA, Weinheim)<\/jats:p>","DOI":"10.1002\/malq.200310113","type":"journal-article","created":{"date-parts":[[2004,8,18]],"date-time":"2004-08-18T12:02:11Z","timestamp":1092830531000},"page":"473-485","source":"Crossref","is-referenced-by-count":32,"title":["Some recent developments on Shannon's General Purpose Analog Computer"],"prefix":"10.1002","volume":"50","author":[{"given":"Daniel","family":"Silva Gra\u00e7a","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,8,18]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"J. A.Anderson An Introduction to Neural Networks (MIT Press 1995).","DOI":"10.7551\/mitpress\/3905.001.0001"},{"key":"e_1_2_1_3_2","unstructured":"O.Bournez andE.Hainry An analog characterization of computable functions over the real numbers. Submitted for publication."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/85.539911"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00147-B"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0016-0032(31)90616-9"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"M. L.Campagnolo The complexity of real recursive functions. In: Unconventional Models of Computation (UMC'02) (C. S. Calude M. J. Dinneen and F. Peper eds.); Lecture Notes in Computer Science2509 pp. 1\u201314 (Springer\u2010Verlag 2002).","DOI":"10.1007\/3-540-45833-6_1"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2000.0559"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2002.0655"},{"key":"e_1_2_1_10_2","unstructured":"J.Copeland Even Turing machines can compute uncomputable functions. In: Unconventional Models of Computation (UMC'98) (J. Casti C. Calude and M. Dinneen eds.) pp. 150\u2010164 (Springer\u2010Verlag 1998)."},{"key":"e_1_2_1_11_2","unstructured":"General Electric Management Consultant Services Division: The Next Step in Management \u2026 an Appraisal of Cybernetics (1952)."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0885-064X(03)00034-7"},{"key":"e_1_2_1_13_2","unstructured":"S.Haykin Neural Networks: A Comprehensive Foundation (Prentice Hall 1999)."},{"key":"e_1_2_1_14_2","unstructured":"W.Hirsch andS.Smale Differential Equations Dynamical Systems and Linear Algebra (Academic Press 1974)."},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"K.\u2010IKo Computational Complexity of Real Functions (Birkh\u00e4user 1991).","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90229-1"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00117-0"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.2307\/2046643"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02478259"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00248-0"},{"key":"e_1_2_1_21_2","unstructured":"J.Mycka andJ. F.Costa Real recursive functions and their hierarchy. Submitted for publication."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1996.539910"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"P.Orponen A survey of continous\u2010time computation theory. In: Advances in Algorithms Languages and Complexity (D.\u2010Z. Du and K.\u2010I Ko eds.) pp. 209\u2013224 (Kluwer Academic Publishers 1997).","DOI":"10.1007\/978-1-4613-3394-4_11"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/85.539914"},{"key":"e_1_2_1_25_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1974-0347575-8","article-title":"Abstract computability and its relations to the general purpose analog computer","volume":"199","author":"Pour\u2010El M. B.","year":"1974","journal-title":"Trans. Amer. Math. Soc."},{"key":"e_1_2_1_26_2","doi-asserted-by":"crossref","unstructured":"M. B.Pour\u2010El andJ. I.Richards Computability in Analysis and Physics (Springer\u2010Verlag 1989).","DOI":"10.1007\/978-3-662-21717-7"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/85.539916"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(88)90004-8"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.2307\/2324840"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1993.1003"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1941201337"},{"key":"e_1_2_1_32_2","doi-asserted-by":"crossref","unstructured":"H. T.Siegelmann Neural Networks and Analog Computation: Beyond the Turing Limit (Birkh\u00e4user 1999).","DOI":"10.1007\/978-1-4612-0707-8"},{"key":"e_1_2_1_33_2","doi-asserted-by":"crossref","unstructured":"S.Smale Theory of computation. In: Mathematical Research Today and Tomorrow pp. 59\u201369 (Springer\u2010Verlag 1992).","DOI":"10.1007\/BFb0089205"},{"key":"e_1_2_1_34_2","doi-asserted-by":"crossref","unstructured":"K.Weihrauch Computable Analysis: An Introduction (Springer\u2010Verlag 2000).","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.200310113","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.200310113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T16:14:17Z","timestamp":1693412057000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.200310113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,18]]},"references-count":33,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1002\/malq.200310113"],"URL":"https:\/\/doi.org\/10.1002\/malq.200310113","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,18]]}}}