Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,340,307 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.
Highly Cited
2023
Highly Cited
2023
Logic and Computation
A. Parkes
2023
Corpus ID: 59758021
In the last chapter we saw how to use first order predicate logic (FOPL) as a system for representation and reasoning. We noted…
Expand
2017
2017
Long-distance consonant agreement and subsequentiality
H. Luo
2017
Corpus ID: 53982887
Johnson (1972) and Kaplan & Kay (1994) showed that phonological processes belong to the computational class of regular relations…
Expand
1997
1997
Rudimentary Languages and Second‐Order Logic
Malika More
,
Frédéric Olive
Mathematical Logic Quarterly
1997
Corpus ID: 30652162
The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory…
Expand
1995
1995
Constructive mathematics and unbounded operators — A reply to Hellman
D. Bridges
Journal of Philosophical Logic
1995
Corpus ID: 12234724
It is argued that Hellman's arguments purporting to demonstrate that constructive mathematics cannot cope with unbounded…
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
1991
1991
Contributions to recursion theory
David Seetapun
1991
Corpus ID: 118365658
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
1982
1982
The Introduction of Non-Recursive Methods into Mathematics*
G. Metakides
,
A. Nerode
1982
Corpus ID: 116835250
1977
1977
A Lemma Driven Automatic Theorem Prover for Recursive Function Theory
R. Boyer
,
J. S. Moore
International Joint Conference on Artificial…
1977
Corpus ID: 12122083
We describe work in progress on an automatic theorem prover for recursive function theory that we intend to apply in the analysis…
Expand
1967
1967
Computable Functionals of Finite Type I
R. Gandy
1967
Corpus ID: 118282299
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