References
Published online by Cambridge University Press: 23 November 2018
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Abstract Recursion and Intrinsic Complexity , pp. 229 - 236Publisher: Cambridge University PressPrint publication year: 2018
References
Bhaskar, Siddharth [2017] A difference in complexity between recursion and tail recursion, Theory of Computing Systems, vol. 60, pp. 299–313. 124.Google Scholar
Bhaskar, Siddharth [2018] Recursion versus tail recursion over Fp, Journal of Logical and Algebraic Methods in Programming, pp. 68–90. 97.Google Scholar
Bürgisser, P.
, Lickteig, T., and Shub, M. [1992] Test complexity of generic polynomials, Journal of Complexity, vol. 8, pp. 203–215. 225.Google Scholar
Bürgisser, P. and Lickteig, T. [1992] Verification complexity of linear prime ideals, Journal of Pure and Applied Algebra, vol. 81, pp. 247–267. 211, 216.Google Scholar
Busch, Joseph [2007] On the optimality of the binary algorithm for the Jacobi symbol, Fundamenta Informaticae, vol. 76, pp. 1–11. 170.Google Scholar
Busch, Joseph [2009] Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings, Journal of Symbolic Computation, vol. 44, pp. 683– 689. 170.Google Scholar
Church, Alonzo [1935] An unsolvable problem in elementary number theory, Bulletin of the American Mathematical Society, vol. 41, pp. 332–333, This is an abstract of Church [1936]. 99, 229.Google Scholar
Church, Alonzo [1936] An unsolvable problem in elementary number theory, American Journal of Mathematics, pp. 345–363, An abstract of this paper was published in Church [1935]. 99, 229.Google Scholar
Cohen, F. and Selfridge, J. L. [1975] Not every number is the sum or difference of two prime powers, Mathematics of Computation, vol. 29, pp. 79–81. 165.Google Scholar
Colson, L. [1991] About primitive recursive algorithms, Theoretical Computer Science, vol. 83, pp. 57–69. 125.Google Scholar
Cook, Stephen A. and Reckhow, Robert A. [1973] Time bounded Random Access Machines, Journal of Computer and System Sciences, vol. 7, pp. 354–375. 91, 93, 138, 158.Google Scholar
Dasgupta,
S.
, Papadimitriou, C., and Vazirani, U. [2011] Algorithms, McGraw-Hill. 153.Google Scholar
Davis,
Martin
[1958] Computability and unsolvability, Originally published by McGraw-Hill, available from Dover. 4.Google Scholar
Dershowitz, Nachum and Gurevich, Yuri [2008] A natural axiomatization of computability and proof of Church’s Thesis, The Bulletin of Symbolic Logic, vol. 14, pp. 299–350. 100.Google Scholar
Dries, Lou van den and Moschovakis, Yiannis N. [2004] Is the Euclidean algorithm optimal among its peers?, The Bulletin of Symbolic Logic, vol. 10, pp. 390–418 4, 5, 125, 129, 152, 159, 168, 169, 187, 189. Posted in ynm’s homepage.Google Scholar
Dries, Lou van den and Moschovakis, Yiannis N. [2009] Arithmetic complexity, ACM Trans. Comput. Logic, vol. 10, no. 1, pp. 1–49 4, 5, 125, 129, 146, 159, 189, 201, 204, 205, 206, 208. Posted in ynm’s homepage.Google Scholar
Dries, Lou van den [2003] Generating the greatest common divisor, and limitations of primitive recursive algorithms, Foundations of Computational Mathematics, vol. 3, pp. 297–324. 5, 125.CrossRefGoogle Scholar
Duží,
M.
[2014] A procedural interpretation of the Church-Turing thesis, Church’s Thesis: Logic, Mind and Nature (Adam Olszewski, Bartosz Brozek, and Piotr Urbanczyk, editors), Copernicus Center Press, Krakow 2013. 100.Google Scholar
Boas, P. van Emde [1990] Machine models and simulations, van Leeuwen [1990], pp. 1–66. 2, 69, 91.Google Scholar
Enderton,
Herbert
[2001] A mathematical introduction to logic, Academic Press, Second edition. 44.Google Scholar
Fredholm, Daniel [1995] Intensional aspects of function definitions, Theoretical Computer Science, vol. 163, pp. 1–66. 125.CrossRefGoogle Scholar
Gandy, Robin [1980] Church’s Thesis and principles for mechanisms, The Kleene Symposium (Barwise, J., Keisler, H. J., and Kunen, K., editors), North Holland Publishing Co, pp. 123–148. 99.Google Scholar
Greibach, Sheila A. [1975] Theory of program structures: Schemes, Semantics, Verification, Lecture Notes in Computer Science, vol. 36, Springer-Verlag. 58.Google Scholar
Gurevich, Yuri [1995] Evolving algebras 1993: Lipari guide, Specification and validation methods (Börger, E., editor), Oxford University Press, pp. 9–36. 100.Google Scholar
Gurevich, Yuri [2000] Sequential abstract state machines capture sequential algorithms, ACM Transactions on Computational Logic, vol. 1, pp. 77–111. 100.Google Scholar
Hardy, G. H. and Wright, E. M. [1938] An introduction to the theory of numbers, Clarendon Press, Oxford, fifth edition (2000). 178, 204.Google Scholar
Jones, Neil D. [1999] LOGSPACE and PTIME characterized by programming languages, Theoretical Computer Science, pp. 151–174. 97.Google Scholar
Jones, Neil D. [2001] The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, vol. 11, pp. 55–94. 97.Google Scholar
Kechris, A. S. and Moschovakis, Y. N. [1977] Recursion in higher types, Handbook of mathematical logic (Barwise, J., editor), Studies in Logic, No. 90, North Holland, Amsterdam, pp. 681– 737. 100.Google Scholar
Kleene, Stephen C. [1952] Introduction to metamathematics, D. Van Nostrand Co, North Holland Co. 4, 57, 63.Google Scholar
Kleene, Stephen C. [1959] Recursive functionals and quantifiers of finite types I, Transactions of the American Mathematical Society, vol. 91, pp. 1–52. 100.Google Scholar
Knuth, D. E. [1973] The Art of Computer Programming, Volume 1. Fundamental Algorithms, second ed., Addison-Wesley. 100.Google Scholar
Knuth, D. E. [1981] The Art of Computer Programming, Volume 2. Seminumerical algorithms, second ed., Addison-Wesley. 24.Google Scholar
Kripke, Saul A. [2000] From the Church-Turing Thesis to the First-Order Algorithm Theorem, Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (Washington, DC, USA), LICS’00, IEEE Computer Society, The reference is to an abstract. A video of a talk by Saul Kripke at The 21st International Workshop on the History and Philosophy of Science with the same title is posted at http://www.youtube.com/watch?v=D9SP5wj882w, and this is my only knowledge of this article. 99.Google Scholar
Leeuwen, J. van [1990] Handbook of theoretical computer science, vol. A, Algorithms and Complexity, Elsevier and the MIT Press. 230.Google Scholar
Lynch, Nancy A. and Blum, Edward K. [1979] A difference in expressive power between flowcharts and recursion schemes, Mathematical Systems Theory, pp. 205–211. 95, 97.Google Scholar
Manna,
Zohar
[1974] Mathematical theory of computation, Originally published by McGraw-Hill, available from Dover. 20, 49.Google Scholar
Mansour, Yishay
, Schieber, Baruch, and Tiwari, Prasoon [1991a] A lower bound for integer greatest common divisor computations, Journal of the Association for Computing Machinery, vol. 38, pp. 453–471. 146.Google Scholar
Mansour, Yishay
, Schieber, Baruch, and Tiwari, Prasoon [1991b] Lower bounds for computations with the floor operation, SIAM Journal on Computing, vol. 20, pp. 315–327. 194, 201, 202.Google Scholar
McCarthy, John [1960] Recursive functions of symbolic expressions and their computation by machine, Part I, Communications Of the ACM, vol. 3, pp. 184–195. 49.Google Scholar
McCarthy, John [1963] A basis for a mathematical theory of computation, Computer programming and formal systems (Braffort, P. and Herschberg, D, editors), North-Holland, pp. 33–70. 49, 52.Google Scholar
McColm, Gregory L. [1989] Some restrictions on simple fixed points of the integers, The Journal of Symbolic Logic, vol. 54, pp. 1324–1345. 60.Google Scholar
Meidânis, João [1991] Lower bounds for arithmetic problems, Information Processing Letters, vol. 38, pp. 83–87. 201.Google Scholar
Moschovakis, Yiannis N. [1984] Abstract recursion as a foundation of the theory of algorithms, Computation and proof theory (Richter, M. M. et al., editors), vol. 1104, Springer-Verlag, Berlin, Lecture Notes in Mathematics, pp. 289–364. 3, 59.Google Scholar
Moschovakis, Yiannis N. [1989a] The formal language of recursion, The Journal of Symbolic Logic, vol. 54, pp. 1216–1252 3, 49, 99, 100. Posted in ynm’s homepage.Google Scholar
Moschovakis, Yiannis N. [1989b] A mathematical modeling of pure, recursive algorithms, Logic at Botik’89 (Meyer, A. R. and Taitslin, M. A., editors), vol. 363, Springer-Verlag, Berlin, Lecture Notes in Computer Science, pp. 208–229 100. Posted in ynm’s homepage.Google Scholar
Moschovakis, Yiannis N. [1998] On founding the theory of algorithms, Truth in mathematics (Dales, H. G. and Oliveri, G., editors), Clarendon Press, Oxford, pp. 71–104 3, 100, 101. Posted in ynm’s homepage.Google Scholar
Moschovakis, Yiannis N. [2001] What is an algorithm?, Mathematics unlimited – 2001 and beyond (Engquist, B. and Schmid, W., editors), Springer, pp. 929–936 3. Posted in ynm’s homepage.Google Scholar
Moschovakis, Yiannis N. [2003] On primitive recursive algorithms and the greatest common divisor function, Theoretical Computer Science, vol. 301, pp. 1–30. 125.Google Scholar
Moschovakis, Yiannis N. [2006] Notes on set theory, second edition, Undergraduate texts in mathematics, Springer. 19.Google Scholar
Moschovakis, Yiannis N. [2014] On the Church-Turing Thesis and relative recursion, Logic and Science Facing the New Technologies (Schroeder-Heister, Peter, Heinzmann, Gerhard, Hodges, Wilfrid, and Bour, Pierre Edouard, editors), College Publications, Logic, Methodology and Philosophy of Science, Proceedings of the 14th International Congress (Nancy), pp. 179–200 99. Posted in ynm’s homepage.Google Scholar
Moschovakis, Yiannis N. and Paschalis, Vasilis [2008] Elementary algorithms and their implementations, New computational paradigms (Cooper, S. B., Lowe, Benedikt, and Sorbi, Andrea, editors), Springer, pp. 81—118 101. Posted in ynm’s homepage.Google Scholar
Ostrowski, A. M. [1954] On two problems in abstract algebra connected with Horner’s rule, Studies presented to R. von Mises, Academic Press, New York, pp. 40–48. 209.Google Scholar
Pan, V. Ya. [1966] Methods for computing values of polynomials, Russian Mathematical Surveys, vol. 21, pp. 105–136. 211.Google Scholar
Patterson, Michael S. and Hewitt, Carl E. [1970] Comparative schematology, MIT AI Lab publication posted at http://hdl.handle.net/1721.1/6291 with the date 1978. 95, 97.Google Scholar
Plotkin, Gordon [1977] LCF considered as a programming language, Theoretical Computer Science, vol. 5, pp. 223–255. 3.Google Scholar
Pratt, Vaughan [1975] Every prime has a succint certificate, SIAM Journal of computing, vol. 4, pp. 214–220. 143.Google Scholar
Pratt,
Vaughan
[2008] Euclidean gcd is exponentially suboptimal: why gcd is hard to analyse, unpublished manuscript. 85.Google Scholar
Rogers,
Hartley
[1967] Theory of recursive functions and effective computability, McGraw-Hill. 4.Google Scholar
Sacks,
Gerald E.
[1990] Higher recursion theory, Perspectives in Mathematical Logic, Springer. 100.Google Scholar
Scott, D. S. and Strachey, C. [1971] Towards a mathematical semantics for computer languages, Proceedings of the symposium on computers and automata (New York) (Fox, J., editor), Polytechnic Institute of Brooklyn Press, pp. 19–46. 3.Google Scholar
Stein, J. [1967] Computational problems associated with Racah Algebra, Journal of Computational Physics, vol. 1, pp. 397Ű–405. 24.Google Scholar
Stolboushkin, A. P. and Taitslin, M. A. [1983] Deterministic dynamic logic is strictly weaker than dynamic logic, Information and Control, vol. 57, pp. 48–55. 97.Google Scholar
Sun, Z. W. [2000] On integers not of the form ±pa ± qb , Proceedings of the American Mathematical Society, vol. 208, pp. 997–1002. 165.Google Scholar
Tao, Terence [2011] A remark on primality testing and decimal expansions, Journal of the Australian Mathematical Society, vol. 91, pp. 405–413. 165.Google Scholar
Tarski, Alfred [1986] What are logical notions?, History and Philosophy of Logic, vol. 7, pp. 143–154, edited by John Corcoran. 152.Google Scholar
Tiuryn, Jerzy [1989] A simplified proof of DDL < DL, Information and Computation, vol. 82, pp. 1–12. 97, 98.Google Scholar
Tserunyan, Anush [2013] (1) Finite generators for countable group actions; (2) Finite index pairs of equivalence relations; (3) Complexity measures for recursive programs, Ph.D. Thesis, University of California, Los Angeles, Kechris, A. and Neeman, I., supervisors. 118, 121, 123.Google Scholar
Tucker, J.V. and Zucker, J.I. [2000] Computable functions and semicomputable sets on many-sorted algebras, Handbook of Logic in Computer Science (Abramsky, S., Gabbay, D.M., and Maibaum, T.S.E., editors), vol. 5, Oxford University Press, pp. 317–523. 100.Google Scholar
Turing, Alan M. [1936] On computable numbers with an application to the Entscheidung-sproblem, Proceedings of the London Mathematical Society, vol. 42, pp. 230– 265, A correction, ibid. volume 43 (1937), pp. 544–546. 99.Google Scholar
Walker, S. A. and Strong, H. R. [1973] Characterizations of flowchartable recursions, Journal of Computer and System Science, vol. 7, pp. 404–447. 97.Google Scholar
Winograd, Shmuel [1967] On the number of multiplications required to compute certain functions, Proceedings of the National Academy of Sciences, USA, vol. 58, pp. 1840– 1842. 212.Google Scholar
Winograd, Shmuel [1970] On the number of multiplications required to compute certain functions, Communications on pure and applied mathematics, vol. 23, pp. 165–179. 212.Google Scholar