- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the Definition of Computable Function of a Real Variable
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):391-402 (1976)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On the Definition of Computable Function of a Real Variable.J. C. Shepherdson - 1976 - Mathematical Logic Quarterly 22 (1):391-402.
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Approaches to Effective Semi‐Continuity of Real Functions.Xizhong Zheng, Vasco Brattka & Klaus Weihrauch - 1999 - Mathematical Logic Quarterly 45 (4):481-496.
Monotonically Computable Real Numbers.Robert Rettinger, Xizhong Zheng, Romain Gengler & Burchard von Braunmühl - 2002 - Mathematical Logic Quarterly 48 (3):459-479.
Algorithmic randomness of continuous functions.George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):533-546.
The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
A uniformly computable Implicit Function Theorem.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (3):272-279.
The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
On the decidability of the real field with a generic power function.Gareth Jones & Tamara Servi - 2011 - Journal of Symbolic Logic 76 (4):1418-1428.
Analytics
Added to PP
2016-02-04
Downloads
24 (#651,177)
6 months
1 (#1,472,167)
2016-02-04
Downloads
24 (#651,177)
6 months
1 (#1,472,167)
Historical graph of downloads
Citations of this work
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I.Iraj Kalantari & Lawrence Welch - 1998 - Annals of Pure and Applied Logic 93 (1-3):125-151.
A computable ordinary differential equation which possesses no computable solution.Marian Boylan Pour-el - 1979 - Annals of Mathematical Logic 17 (1):61.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-vwmnd uwo