Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Computation in the limit
Known as:
Computability in the limit
, Limit lemma
, Limit-computable
Expand
In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Broader (2)
Computability theory
Theory of computation
Halting problem
Modulus of convergence
Post's theorem
Specker sequence
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A limit-computable function which does not have any single-fold Diophantine representation and whose computability is an open question
A. Tyszka
2013
Corpus ID: 121375887
For a positive integer n, let f (n) denote the smallest non-negative integer b such that for each system S ⊆ {xi = 1, xi + x j…
Expand
2012
2012
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data
Sanjay Jain
,
F. Stephan
,
T. Zeugmann
Theory and Applications of Models of Computation
2012
Corpus ID: 6385221
Nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [18] and…
Expand
2011
2011
Minimum distance lack-of-fit tests for fixed design
H. Koul
2011
Corpus ID: 45994163
2010
2010
Limit Computable Sets and Degrees
William Chan
2010
Corpus ID: 16025058
This paper will study sets and degrees containing sets that are determined as limits of computable approximations. By the…
Expand
2003
2003
If intelligence is uncomputable, then
Peter Kugel
2003
Corpus ID: 13373728
An intelligent disk drive having error detection and correction capability employs an embedded error correction controller with a…
Expand
2002
2002
Limit-Computable Mathematics and Its Applications
S. Hayashi
,
Y. Akama
Annual Conference for Computer Science Logic
2002
Corpus ID: 33505047
Limit-Computable Mathematics (LCM) is a fragment of classical mathematics in which classical principles are restricted so that…
Expand
1993
1993
The Learnability of Recursive Languages in Dependence on the Hypothesis Space
T. Zeugmann
1993
Corpus ID: 18257372
We study the learnability of indexed families L = (L j ) j2IN of uniformly recursive languages under certain monotonicity…
Expand
1993
1993
Some special limits of Schottky groups
D. Gallo
1993
Corpus ID: 29808163
We show that every extended Schottky group G which uniformizes a compact Riemann surface S is a geometric limit of Schottky…
Expand
1984
1984
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings
R. Freivalds
,
E. Kinber
,
Rolf Wiehagen
Mathematical Logic Quarterly
1984
Corpus ID: 29862044
Functionals and operations have been studied extensively in the theory of recursive functions (cf. [13]). We want to investigate…
Expand
1970
1970
On the Efficiency of Algorithms
David Pager
JACM
1970
Corpus ID: 263884075
A definition is given of the efficiency of an algorithm considered as a whole. This immediately raises the question of whether it…
Expand
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