Advertisement

Natural Computing

, Volume 11, Issue 1, pp 37–49 | Cite as

A survey of recursive analysis and Moore’s notion of real computation

  • Walid Gomaa
Article
  • 140 Downloads

Abstract

The theory of analog computation aims at modeling computational systems that evolve in a continuous space. Unlike the situation with the discrete setting there is no unified theory of analog computation. There are several proposed theories, some of them seem quite orthogonal. Some theories can be considered as generalizations of the Turing machine theory and classical recursion theory. Among such are recursive analysis and Moore’s class of recursive real functions. Recursive analysis was introduced by Turing (Proc Lond Math Soc 2(42):230–265, 1936), Grzegorczyk (Fundam Math 42:168–202, 1955), and Lacombe (Compt Rend l’Acad Sci Paris 241:151–153, 1955). Real computation in this context is viewed as effective (in the sense of Turing machine theory) convergence of sequences of rational numbers. In 1996 Moore introduced a function algebra that captures his notion of real computation; it consists of some basic functions and their closure under composition, integration and zero-finding. Though this class is inherently unphysical, much work have been directed at stratifying, restricting, and comparing it with other theories of real computation such as recursive analysis and the GPAC. In this article we give a detailed exposition of recursive analysis and Moore’s class and the relationships between them.

Keywords

Recursive analysis Turing machine GPAC Analog computation Function algebra 

References

  1. Bellantoni S, Cook S (1992) A new recursion-theoretic characterization of the polytime functions. Comput Complex 2:97–110Google Scholar
  2. Blondel V, Tsitsiklis J (2000) A survey of computational complexity results in systems and control. Automatica 36(9):1249–1274Google Scholar
  3. Bournez O, Campagnolo M (2008) A survey on continuous time computations. In: Cooper SB, Löwe B, Sorbi A (eds) New computational paradigms. Changing conceptions of what is computable. Springer-Verlag, New York, pp 383–423Google Scholar
  4. Bournez O, Hainry E (2004a) An analog characterization of elementarily computable functions over the real numbers. Lecture Notes in Computer Science, vol 3142, pp 269–280Google Scholar
  5. Bournez O, Hainry E (2004b) Real recursive functions and real extensions of recursive functions. Lecture Notes in Computer Science, vol 3354, pp 116–127Google Scholar
  6. Bournez O, Hainry E (2005) Elementarily computable functions over the real numbers and \({\mathbb{R}}\)-sub-recursive functions. Theor Comput Sci 348(2–3):130–147Google Scholar
  7. Bournez O, Hainry E (2006) Recursive analysis characterized as a class of real recursive functions. Fundam Inf 74(4):409–433Google Scholar
  8. Bournez O, Campagnolo M, Graça D, Hainry E (2007) Polynomial differential equations compute all real computable functions on computable compact intervals. J Complex 23(3):317–335Google Scholar
  9. Bournez O, Gomaa W, Hainry E. Algebraic characterizations of complexity-theoretic classes of real functions. Int J Unconv Comput (accepted)Google Scholar
  10. Bush V (1931) The differential analyzer. A new machine for solving differential equations. J. Franklin Inst. 212:447–488Google Scholar
  11. Campagnolo M (2001) Computational complexity of real valued recursive functions and analog circuits. PhD thesis, Instituto Superior TécnicoGoogle Scholar
  12. Campagnolo M (2002) The complexity of real recursive functions. Lecture Notes in Computer Science, vol 2509, pp 1–14Google Scholar
  13. Campagnolo M, Ojakian K (2008) Characterizing computable analysis with differential equations. Electr Notes Theor Comput Sci 221:23–35Google Scholar
  14. Campagnolo M, Ojakian K (2008) The elementary computable functions over the real numbers: applying two new techniques. Arch Math Log 46(7–8):593–627Google Scholar
  15. Campagnolo M, Moore C, Costa J (2000a) An analog characterization of the subrecursive functions. In: 4th Conference on real numbers and computers, pp 91–109Google Scholar
  16. Campagnolo M, Moore C, Costa J (2000b) Iteration, inequalities, and differentiability in analog computers. J Complex16(4):642–660Google Scholar
  17. Campagnolo M, Moore C, Costa J (2002) An analog characterization of the Grzegorczyk hierarchy. J Complex 18(4):977–1000Google Scholar
  18. Clote P (1999) Computational models and function algebras. In: Handbook of computability theory. Elsevier, Amsterdam, pp 589–681Google Scholar
  19. Costa J, Loff B, Mycka J (2009) A foundation for real recursive function theory. Ann Pure Appl Log 160:255–288Google Scholar
  20. Gakwaya J (1997) A survey of the Grzegorczyk hierarchy and its extension through the BSS model of computability. NeuroCOLT technical report series, technical report, Royal Holloway, University of London.Google Scholar
  21. Gomaa W (2010) Polynomial time computation in the context of recursive analysis. Lecture Notes in Computer Science, vol 6324, pp 146–162Google Scholar
  22. Gomaa W Rational vs. real computation. Int J Softw Inf (to appear)Google Scholar
  23. Graça DS (2004) Some recent developments on Shannon’s general purpose analog computer. Math Log Quart 50:473–485Google Scholar
  24. Graça DS, Costa JF (2003) Analog computers and recursive functions over the reals. J Complex 19(5):644–664Google Scholar
  25. Graça D, Campagnolo M, Buescu J (2005) Robust simulations of Turing machines with analytic maps and flows. Lecture Notes in Computer Science, vol 3526, pp 169–179Google Scholar
  26. Grzegorczyk A (1953) Some classes of recursive functions. Rosprawy Mat 4:1–45Google Scholar
  27. Grzegorczyk A (1955) Computable functionals. Fundam Math 42:168–202Google Scholar
  28. Kalmár L (1943) EgyzzerüPélda Eldönthetetlen Aritmetikai Problémára. Mateés Fizikai Lapok 50:1–23Google Scholar
  29. Kawamura A (2009) Differential recursion. ACM Trans Comput Log 10(3):1–20Google Scholar
  30. Ko K-I (1991) Complexity theory of real functions. Birkhäuser, BaselGoogle Scholar
  31. Lacombe D (1955) Extension de la Notion de Fonction Récursive aux Fonctions d’une ou Plusieurs Variables Réelles III. Compt Rend l’Acad Sci Paris 241:151–153Google Scholar
  32. Lipshitz L, Rubel LA (1987) A differentially algebraic replacement theorem, and analog computability. Proc Am Math Soc 99(2):367–372Google Scholar
  33. Loff B, Costa J, Mycka J (2007) Computability on reals, infinite limits and differential equations. Appl Math Comput 191(2):353–371Google Scholar
  34. Meer K, Michaux C (1997) A survey on real structural complexity theory. Bull Belg Math Soc 4(1):113–148Google Scholar
  35. Moore C (1996) Recursion theory on the reals and continuous-time computation. Theor Comput Sci 162(1):23–44Google Scholar
  36. Mycka J (2003) μ-Recursion and infinite limits. Theor Comput Sci 302:123–133Google Scholar
  37. Mycka J, Costa J (2004) Real recursive functions and their hierarchy. J Complex 20(6):835–857Google Scholar
  38. Mycka J, Costa JF (2005) What lies beyond the mountains? Computational systems beyond the turing limit. Eur Assoc Theoret Comput Sci Bull 85:181–189Google Scholar
  39. Mycka J, Costa J (2006a) The conjecture \(P\not=NP\) Presented by means of some classes of real functions. Lecture Notes in Computer Science, vol 3988, pp 47–57Google Scholar
  40. Mycka J, Costa J (2006b) The \(P\not=NP\) conjecture in the context of real and complex analysis. J Complex 22(2):287–303Google Scholar
  41. Mycka J, Costa J (2007) A new conceptual framework for analog computation. Theor Comput Sci 374:277–290Google Scholar
  42. Orponen P (1997) A survey of continous-time computation theory. In: Advances in algorithms, languages, and complexity. Springer, Berlin, pp 209–224Google Scholar
  43. Pour-El MB (1974) Abstract computability and its relation to the general purpose analog computer. Trans Am Math Soc 199:1–28Google Scholar
  44. Rose HE (1984) Subrecursion: functions and Hierarchies. Clarendon Press, OxfordGoogle Scholar
  45. Shannon CE (1941) Mathematical theory of the differential analyzer. J Math Phys MIT 20:337–354Google Scholar
  46. Turing A (1936) On computable numbers, with an application to the Entscheidungs problem. Proc Lond Math Soc 2(42):230–265, (correction ibid. 43:544–546, 1937).Google Scholar
  47. Weihrauch K (2000) Computable analysis: an introduction, 1st edn. Springer, BerlinGoogle Scholar
  48. Zhou Q (1997) Computing and combinatorics. In: Subclasses of computable real valued functions. Lecture Notes in Computer Science, vol 1276. Springer Berlin/Heidelberg, pp 156–165Google Scholar
  49. Zimmerman J (1990) Classes of Grzegorczyk’s-computable real numbers. PhD thesis, University of MinnesotaGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringEgypt-Japan University of Science and TechnologyAlexandriaEgypt
  2. 2.Faculty of EngineeringAlexandria UniversityAlexandriaEgypt

Personalised recommendations