Keywords
- Entire Function
- Analog Computer
- Digital Computer
- Computable Function
- Preliminary Definition
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Church, A. An unsolvable problem in elementary number theory. American Journal of Mathematics vol. 58 (1936) pp. 345–363.
Crank, J. The Differential Analyser. Longmans, Green & Co. 1947, viii+ 137 pp.
Grzegorczyk, A. On the definitions of computable real continuous functions. Fundamenta Mathematicae vol. 44 (1957) pp. 61–71.
Hölder, O. Ueber die Eigenschaft der Gamma function keiner algebraischen Differentialgleichung zu genügen. Mathematische Annalen vol. 28 (1887) pp. 1–13.
Jackson, A. Analog Computation. McGraw Hill Book Co. Inc. (1960) xiv + 652 pp.
Johnson, C. Analog Computer Techniques. McGraw Hill Book Co., Inc. (1963) xii + 315 pp.
Kleene, S.C. Introduction to Metamathematics. D. van Nostrand Co., (1952) x + 550 pp.
Korn, G.A., and Korn, T.M. Electronic Analog and Hybrid Computers. McGraw-Hill Book Co., New York (1964) xxiii + 584 pp.
Lacombe, D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles. C.R. Acad. Sci. Paris, I t.240 (1955) pp. 2478–2480, II, t.241 (1955) pp. 13–14, III t.241 (1955) pp. 151–153.
Markov, A. The Theory of Algorithms (Russian) Trudy Mathematicheskogo Institutaimeni V.A. Steklova, vol. 38 pp. 176–189.
Pólya, G. Über das Anwachsen von ganzen Funktionen die einer Differentialgleichung genügen. Vierteljahrsschrift der Naturforsch. Gesellschaft in Zürich vol. 41 (1916) pp. 531–545.
Pólya, G. Zur Untersuchung der Grössenordnung ganzer Funktionen, die einer Differentialgleichung genügen. Acta Mathematica vol. 42 (1920) pp. 309–316.
Shannon, C. Mathematical theory of the differential analyzer. Journal of Mathematics and Physics vol. 20 (1941) pp. 337–354.
Soroka, W. Analog Methods in Computation and Simulation. McGraw-Hill Book Co. New York (1954) xii + 390 pp.
Tomovic, R. and Karplus, W.J. High Speed Analog Computers. Wiley and Sons, New York (1962) xi + 255 pp.
Turing, A. On computable numbers with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society ser. 2, vol. 42 pp. 230–265; vol. 43, pp. 544–546.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Pour-El, M.B. (1973). Abstract computability versus analog-generability (a survey). In: Mathias, A.R.D., Rogers, H. (eds) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066781
Download citation
DOI: https://doi.org/10.1007/BFb0066781
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05569-3
Online ISBN: 978-3-540-36884-7
eBook Packages: Springer Book Archive
