Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,011,356 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.
2014
2014
Computable real function F such that F is not polynomial time computable on [0, 1]
S. V. Yakhontov
arXiv.org
2014
Corpus ID: 15357707
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of…
Expand
2014
2014
Notes on space complexity of integration of computable real functions in Ko-Friedman model
S. V. Yakhontov
2014
Corpus ID: 15521533
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…
Expand
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