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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
s of invited plenary talks ◮ JAN A. BERGSTRA, INGE BETHKE, AND ALBAN PONSE, Decision problems for pushdown threads. Department of… 
2009
2009
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… 
Highly Cited
2005
Highly Cited
2005
We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue… 
2005
2005
By the sometimes so-called Main Theorem of Recursive Analysis, every computable real function is necessarily continuous. We… 
1982
1982
  • K. Ko
  • 1982
  • Corpus ID: 21848101