# Computability

```@article{Jiang1999Computability,
title={Computability},
author={Tao Jiang and Ming Li and Bala Ravikumar and Kenneth W. Regan},
journal={Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic},
year={1999}
}```
• Published 1 February 2022
• Computer Science
• Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic
In the last two chapters, we have introduced several important computational models, including Turing machines, and Chomsky’s hierarchy of formal grammars. In this chapter, we will explore the limits of mechanical computation as defined by these models. We begin with a list of fundamental problems for which automatic computational solution would be very useful. One of these is the universal simulation problem: can one design a single algorithm that is capable of simulating any algorithm? Turing…
208 Citations

## Figures and Tables from this paper

The Church-Turing Thesis over Arbitrary Domains
• Computer Science
Pillars of Computer Science
• 2008
It is shown that the Church-Turing Thesis is not well defined for arbitrary domains, and an axiomatization of an "effective model of computation" over an arbitrary countable domain is proposed, based on Gurevich's postulates for sequential algorithms.
Computability equivalence of an extended Petri net model
A different path is proposed by first proving that all recursive functions are APN computable, and the opposite implication is obtained from Kleene’s normal form theorem for APN.
Basic Computability Theory
This course defines a 'computable function' (a function whose values can be computed using an algorithm), which leads to an indexing of computable functions, and the structure of this indexed collection is studied.
Recursion Only on the Actual
Our purpose here is to focus attention on a development in computer science that has remarkable implications for the philosophy of mathematics. Bellantoni and Cook [BC] gave a purely syntactical
Computation Environments, An Interactive Semantics for Turing Machines (which P is not equal to NP considering it)
It is proved that the computist who lives inside the environment \$E_T\$ can never be confident that whether he lives in a static environment or a persistently evolutionary one, and provides an axiomatic system for Turing computability.
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
• Mathematics
Log. J. IGPL
• 2008
The main result shows that universal undecidability properties granted in computation are also shared by the first-order logical theories, and can be extended to formal systems not directly related with the notion of computation.
The Universal Computer: The Road from Leibniz to Turing
In this revised edition Davis discusses the success of the IBM Watson on Jeopardy, reorganizes the information on incompleteness, and adds information on Konrad Zuse.
Comparing Computational Power
• Computer Science
Log. J. IGPL
• 2006
It is argued that a better definition is that model A is strictly stronger than B if A can simulate B via some encoding, whereas B cannot simulate A under any encoding, and it is shown that with this definition, the recursive functions are strictly weaker than the primitive recursive.
Recursion and topology on 2 6 ! for possibly in ' nite computations Ver )
In the context of possibly in'nite computations yielding 'nite or in'nite (binary) outputs, the space 2 = 2∗ ∪ 2 appears to be one of the most fundamental spaces in Computer Science. Though

## References

SHOWING 1-10 OF 26 REFERENCES
MINSKY'S SMALL UNIVERSAL TURING MACHINE
Marvin L. Minsky constructed a 4-symbol 7-state universal Turing machine in 1962. It was first announced in a postscript to [2] and is also described in [3, Sec. 14.8]. This paper contains everything
An Introduction to Formal Language Theory
• Computer Science
Texts and Monographs in Computer Science
• 1988
This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
An Introduction to Kolmogorov Complexity and Its Applications
• Computer Science
Texts and Monographs in Computer Science
• 1993
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.
The complexity of loop programs
• Computer Science
ACM '67
• 1967
A class of programs, called “Loop programs,” which consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD.
The Language of Machines: an Introduction to Computability and Formal Languages
• Computer Science
• 1994
An up-to-date, authoritative text for courses in theory of computability and languages. The authors redefine the building blocks of automata theory by offering a single unified model encompassing all
On computational complexity and the nature of computer science
In scientific work, the recognition by one’s peers is one of the greatest rewards. In particular, an official recognition by the scientific community, as Richard Stearns and I are honored by the 1993
Proving theorems by pattern recognition I
It now appears that as more progress is made, strategies in the search for proofs, or what are often called heuristic methods, will also gradually become part of the subject matter of inferential analysis.
On computable numbers, with an application to the Entscheidungsproblem
• A. Turing
• Computer Science
Proc. London Math. Soc.
• 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
String-Rewriting Systems
• Computer Science
Text and Monographs in Computer Science
• 1993
This chapter provides formal definitions of string-rewriting systems and their induced reduction relations and Thue congruences and relies on Section 1.4 for basic definitions and notation for strings.