Keyword

computability theory

Description: Computability theory is a branch of mathematical logic that studies computable functions, algorithms, and the limits of computation.

Primary topic: Computability, Logic, AI Algorithms (80%)

Wikidata ID: wiki/Q818930

OpenAlex ID: keywords/computability-theory

Theory of Recursive Functions and Effective Computability.

1969 · Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 2,788

Theory of Recursive Functions and Effective Computability

1969 · D. C. Cooper · The Computer Journal · 2,539

An Introduction to Kolmogorov Complexity and Its Applications

1997 · Ming Li, Paul Vitányi · Springer eBooks · 1,775

Continuous Lattices and Domains

2003 · G. Gierz, K. H. Hofmann, et al. · Cambridge University Press eBooks · 1,593

Dynamic Logic

2000 · David Harel, Dexter Kozen, et al. · 1,439

Classes of Recursively Enumerable Sets and Their Decision Problems

1953 · H. G. Rice · Transactions of the American Mathematical Society · 865

PDF

Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165 pp. - C. Smoryński. D.1. The incompleteness theorems. Pp. 821–865. - Helmut Schwichtenberg. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895. - Richard Statman. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912. - Solomon Feferman. D.4. Theories of finite type related to mathematical practice. Pp. 913–971. - A. S. Troelstra. D.5. Aspects of constructive mathematics. Pp. 973–1052. - Michael P. Fourman. D.6. The logic of topoi. Pp. 1053–1090. - Henk P. Barendregt. D.1. The type free lambda calculus. Pp. 1091–1132. - Jeff Paris and Leo Harrington. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142.

1984 · W. A. Howard · Journal of Symbolic Logic · 834

Computability and Logic

2002 · George S. Boolos, John P. Burgess, et al. · Cambridge University Press eBooks · 823

Dynamic Logic

2000 · David Harel, Dexter Kozen, et al. · The MIT Press eBooks · 769

Mathematical Theory of Computation

1972 · Zohar Manna · CERN Document Server (European Organization for Nuclear Research) · 696

The Formal Semantics of Programming Languages

1993 · Glynn Winskel · The MIT Press eBooks · 693

Computability and Randomness

2009 · André Nies · Oxford University Press eBooks · 617

A variant of a recursively unsolvable problem

1946 · Emil L. Post · Bulletin of the American Mathematical Society · 607

PDF

Hilbert's Tenth Problem is Unsolvable

1973 · Martin Davis · American Mathematical Monthly · 406

Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 24–30.

1970 · Stephen A. Cook · Journal of Symbolic Logic · 383

Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

1987 · Robert I. Soare · 354

Higher Recursion Theory

2017 · Gerald E. Sacks · Cambridge University Press eBooks · 343

Higher Recursion Theory

1990 · Gerald E. Sacks · Perspectives in mathematical logic · 338

Computability: An Introduction to Recursive Function Theory

1980 · Nigel J. Cutland · Medical Entomology and Zoology · 332

A Basis for a Mathematical Theory of Computation

1959 · John McCarthy · Studies in logic and the foundations of mathematics · 321

Degrees of Unsolvability

1983 · Manuel Lerman · Springer eBooks · 303

Hilbert's tenth problem

1994 · Choice Reviews Online · 302

Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (solution of Post's Problem, 1944)

1957 · Richard M. Friedberg · Proceedings of the National Academy of Sciences · 295

Automata and Computability

1977 · Dexter C. Kozen · Springer eBooks · 281

The Upper Semi-Lattice of Degrees of Recursive Unsolvability

1954 · S. C. Kleene, Emil L. Post · Annals of Mathematics · 269

Works count: 5,145

Citation count: 51,520