Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,983,702 papers from all fields of science
Search
Sign In
Create Free Account
Computability theory
Known as:
Recursion theory
, Turing computability
, Theory of computability
Expand
Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Admissible numbering
Alpha recursion theory
Analog computer
Analog signal processing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2009
Review
2009
Randomness in Physics: Five Questions, Some Answers
K. Svozil
2009
Corpus ID: 15450106
Despite provable unknowables in recursion theory, indeterminism and randomness in physics is confined to conventions, subjective…
Expand
2008
2008
Mitotic Classes in Inductive Inference
Sanjay Jain
,
F. Stephan
SIAM journal on computing (Print)
2008
Corpus ID: 8700339
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the…
Expand
2002
2002
SOME APPLICA ALGORITHM I
P. E. Boas
2002
Corpus ID: 207846329
The McCreight-Meyer algorithm is a pi;ority-queue construction irom abstract recursion theory which was designed for the prcof of…
Expand
1995
1995
Rabin Measures
Nils Klarlund
,
D. Kozen
Chicago journal of theoretical computer science
1995
Corpus ID: 14854225
Rabin conditions are a general class of properties of infinite seAbstract-1 quences that encompass most known automata-theoretic…
Expand
1995
1995
The Power of Frequency Computation (Extended Abstract)
M. Kummer
,
F. Stephan
International Symposium on Fundamentals of…
1995
Corpus ID: 14565114
The notion of frequency computation concerns approximative computations of n distinct parallel queries to a set A. A is called (m…
Expand
1994
1994
Two Refinements of the Polynomial Hierarcht
V. Selivanov
Symposium on Theoretical Aspects of Computer…
1994
Corpus ID: 39713299
We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and…
Expand
1988
1988
Partial Objects in Type Theory
Scott F. Smith
1988
Corpus ID: 118700754
Intuitionistic type theories, originally developed by Martin-Lof, provide a foundation for intuitionistic mathematics, much as…
Expand
1979
1979
Generic sets and minimal -degrees
C. Chong
1979
Corpus ID: 53999251
A non-a-recursive subset G of an admissible ordinal a is of minimal a-degree if every set of strictly lower a-degree than that of…
Expand
1975
1975
Recursion theory and descriptive set theory in effectively given T0 spaces
Shunqing. Tang
1975
Corpus ID: 117063681
1973
1973
Contributions to recursion theory on higher types (or, a proof of Harrington's conjecture),
L. Harrington
1973
Corpus ID: 126421935