Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,254,551 papers from all fields of science
Search
Sign In
Create Free Account
Computable real function
In mathematical logic, specifically computability theory, a function is sequentially computable if, for every computable sequence of real numbers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Computable analysis
Definition
Primitive recursive function
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
2005 Summer Meeting of the Association for Symbolic Logic Logic Colloquium '05 Abstracts of Invited Plenary Talks Abstract of Invited Talk in the Short Course on Computer Science Logic
C. Parsons
,
P. Bernays
2012
Corpus ID: 13902187
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of…
Expand
2009
2009
Points on Computable Curves of Computable Lengths
Robert Rettinger
,
Xizhong Zheng
International Symposium on Mathematical…
2009
Corpus ID: 37005435
A computable plane curve is defined as the image of a computable real function from a closed interval to the real plane. As it is…
Expand
2006
2006
Revising Type-2 Computation and Degrees of Discontinuity
M. Ziegler
International Conference on Computability and…
2006
Corpus ID: 11405127
Highly Cited
2005
Highly Cited
2005
Computing over the Reals: Foundations for Scientific Computing
M. Braverman
,
S. Cook
arXiv.org
2005
Corpus ID: 3205526
We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue…
Expand
2005
2005
Real Hypercomputation and Continuity
M. Ziegler
Theory of Computing Systems
2005
Corpus ID: 3264591
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. We…
Expand
2002
2002
Uniform computational complexity of the derivatives of Cinfinity-functions
M. Bläser
Theoretical Computer Science
2002
Corpus ID: 29336465
2002
2002
Effectively Absolute Continuity and Effective Jordan Decomposability
Xizhong Zheng
,
Robert Rettinger
,
Burchard von Braunmühl
International Conference on Computability and…
2002
Corpus ID: 8161416
1986
1986
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
A. Scedrov
Annals of Pure and Applied Logic
1986
Corpus ID: 2825870
Review
1982
Review
1982
Computational Complexity of Real Functions
K. Ko
,
H. Friedman
Theoretical Computer Science
1982
Corpus ID: 206057218
1982
1982
The Maximum Value Problem and NP Real Numbers
K. Ko
Journal of computer and system sciences (Print)
1982
Corpus ID: 21848101
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE