Book ChapterDOI
Degrees of Unsolvability
Klaus Ambos-Spies,Peter A. Fejer +1 more
- Vol. 9, pp 443-494
TLDR
The notion of degree of unsolvability was introduced by Post in [Post, 1944] and has been used extensively in computability theory as mentioned in this paper, where a set A is computable relative to a set B, and B is Turing reducible to A.Abstract:
Modern computability theory began with Turing [Turing, 1936], where he introduced the notion of a function computable by a Turing machine. Soon after, it was shown that this definition was equivalent to several others that had been proposed previously and the Church-Turing thesis that Turing computability captured precisely the informal notion of computability was commonly accepted. This isolation of the concept of computable function was one of the greatest advances of twentieth century mathematics and gave rise to the field of computability theory. Among the first results in computability theory was Church and Turing’s work on the unsolvability of the decision problem for first-order logic. Computability theory to a great extent deals with noncomputable problems. Relativized computation, which also originated with Turing, in [Turing, 1939], allows the comparison of the complexity of unsolvable problems. Turing formalized relative computation with oracle Turing machines. If a set A is computable relative to a set B, we say that A is Turing reducible to B. By identifying sets that are reducible to each other, we are led to the notion of degree of unsolvability first introduced by Post in [Post, 1944]. The degrees form a partially ordered set whose study is called degree theory. Most of the unsolvable problems that have arisen outside of computability theory are computably enumerable (c.e.). The c.e. sets can intuitively be viewed as unbounded search problems, a typical example being those formulas provable in some effectively given formal system. Reducibility allows us to isolate the most difficult c.e. problems, the complete problems. The standard method for showing that a c.e. problem is undecidable is to show that it is complete. Post [Post, 1944] asked if this technique always works, i.e., whether there is a noncomputable, incomplete c.e. set. This problem came to be known as Post’s Problem and it was origin of degree theory. Degree theory became one of the core areas of computability theory and attracted some of the most brilliant logicians of the second half of the twentieth century. The fascination with the field stems from the quite sophisticated techniques needed to solve the problems that arose, many of which are quite easy to state. The hallmark of the field is the priority method introduced byread more
Citations
More filters
OtherDOI
Agent-Based Modeling: The Right Mathematics for the Social Sciences?
Paul L. Borrill,Leigh Tesfatsion +1 more
TL;DR: This study provides a basic introduction to agent-based modeling (ABM) as a powerful blend of classical and constructive mathematics, with a primary focus on its applicability for social science research.
Journal ArticleDOI
Probabilistic computability and choice
TL;DR: This work introduces the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic Turing machine that receives a random binary sequence as auxiliary input and proves an Independent Choice Theorem that implies that Las Vegas Computable functions are closed under composition.
Journal ArticleDOI
The weakness of being cohesive, thin or free in reverse mathematics
TL;DR: In this paper, the authors investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse mathematics and computable reducibility, and identify different layers of unsolvability.
Posted Content
Point degree spectra of represented spaces.
Takayuki Kihara,Arno Pauly +1 more
TL;DR: The point degree spectrum of a represented space is introduced as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on and creates a connection among various areas of mathematics including computability theory, descriptive set theory, infinite dimensional topology and Banach space theory.
Book ChapterDOI
Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
TL;DR: In this paper, it has been shown that arithmetic equivalence is a universal countable Borel equivalence relation, which has interesting corollaries for the theory of universal Borel relations in general.
References
More filters
Journal ArticleDOI
On Computable Numbers, with an Application to the Entscheidungsproblem
TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Journal ArticleDOI
Recursively enumerable sets and degrees
TL;DR: In this paper, the relation of the structure of an R set to its degree is discussed, and the infinite injury priority method is proposed to solve the problem of scaling and splitting R sets.
Book
Theory of Recursive Functions and Effective Computability
TL;DR: In this paper, the authors discuss related theories of recursively enumerable sets, degree of un-solvability and turing degrees in particular, and generalizations of recursion theory.
Journal ArticleDOI
The definition of random sequences
TL;DR: It is shown that the random elements as defined by Kolmogorov possess all conceivable statistical properties of randomness and can equivalently be considered as the elements which withstand a certain universal stochasticity test.