Recursion Theory on the Reals and Continuous-time Computation
Theoretical Computer Science 162:23--44 (1996)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
|
| Through your library | Configure |
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Gualtiero Piccinini & Sonya Bahar (2013). Neural Computation and the Computational Theory of Cognition. Cognitive Science 37 (3):453-488.
Arnold W. Miller (1983). Mapping a Set of Reals Onto the Reals. Journal of Symbolic Logic 48 (3):575-584.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
John B. Goode (1994). Accessible Telephone Directories. Journal of Symbolic Logic 59 (1):92-105.
Harold Simmons (2005). Tiering as a Recursion Technique. Bulletin of Symbolic Logic 11 (3):321-350.
Johanna N. Y. Franklin (2010). Subclasses of the Weakly Random Reals. Notre Dame Journal of Formal Logic 51 (4):417-426.
Robert S. Lubarsky & Michael Rathjen (2008). On the Constructive Dedekind Reals. Logic and Analysis 1 (2):131-152.
W. Aitken & J. A. Barrett (2010). A Note on the Physical Possibility of Transfinite Computation. British Journal for the Philosophy of Science 61 (4):867-874.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Felipe Cucker & Klaus Meer (1999). Logics Which Capture Complexity Classes Over the Reals. Journal of Symbolic Logic 64 (1):363-390.
Monthly downloads |
Added to index2011-03-20Total downloads2 ( #232,211 of 548,951 )Recent downloads (6 months)0How can I increase my downloads? |

