Skip to search formSkip to main contentSkip to account menu

Computable real function

In mathematical logic, specifically computability theory, a function is sequentially computable if, for every computable sequence of real numbers… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Computable analysisDefinitionPrimitive recursive function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Computable real function F such that F is not polynomial time computable on [0, 1]
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of… 
2014
2014
Notes on space complexity of integration of computable real functions in Ko-Friedman model
In the present paper it is shown that real function $g(x)=\int_{0}^{x}f(t)dt$ is a linear-space computable real function on… 
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
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of… 
2009
2009
Polynomial Time Computation in the Context of Recursive Analysis
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955] as an approach for… 
2006
2006
On Some Complexity Issues of NC Analytic Functions
This paper studies the complexity of derivatives and integration of NC real functions (not necessarily analytic) and NC analytic… 
2006
2006
Real Hypercomputation and Degrees of Discontinuity
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous… 
2003
2003
On the Effective Jordan Decomposability
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of… 
2002
2002
Effectively Absolute Continuity and Effective Jordan Decomposability
1986
1986
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
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)