Keyword

computability

Description: Computability is the study of which problems can be solved by effective procedures, especially in mathematical logic and theoretical computer science.

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

Wikidata ID: wiki/Q818888

OpenAlex ID: keywords/computability

On Computable Numbers, with an Application to the Entscheidungsproblem

1937 · A. M. Turing · Proceedings of the London Mathematical Society · 8,227

Introduction to automata theory, languages, and computation

1980 · Computer Languages · 6,824

Computing Machinery and Intelligence (1950)

2004 · Alan Turing · 6,118

Computation: Finite and Infinite Machines.

1968 · D. A. Clarke, Marvin L. Minsky · American Mathematical Monthly · 2,583

Handbook of Formal Languages

1997 · Grzegorz Rozenberg, Arto Salomaa · Springer eBooks · 1,988

Modal Logic

2001 · Patrick Blackburn, Maarten de Rijke, et al. · Cambridge University Press eBooks · 1,689

Recursively enumerable sets and degrees

1978 · Robert I. Soare · Bulletin of the American Mathematical Society · 1,540

PDF

Recursively Enumerable Sets and Degrees

1987 · Robert I. Soare · Perspectives in mathematical logic · 1,339

Descriptive Set Theory

2009 · Yiannis Moschovakis · Mathematical surveys and monographs · 1,171

Computability and Unsolvability.

1959 · C. Elgot, Martin Davis · Mathematical Tables and Other Aids to Computation · 980

Introduction to Mathematical Logic.

1957 · Angelo Margaris, Alonzo Church · American Mathematical Monthly · 931

Computability in Analysis and Physics

1989 · Marian Boykan Pour-El, J. Ian Richards · Perspectives in mathematical logic · 925

Recursively enumerable sets of positive integers and their decision problems

1944 · Emil L. Post · Bulletin of the American Mathematical Society · 873

PDF

Classical Recursion Theory

1999 · Studies in logic and the foundations of mathematics · 871

Computability and Logic

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

The Classical Decision Problem

1997 · Egon Börger, Erich Grädel, et al. · Springer eBooks · 816

Computable Analysis : An Introduction

2014 · Klaus Weihrauch · CERN Document Server (European Organization for Nuclear Research) · 762

The formal semantics of programming languages: an introduction

1993 · Choice Reviews Online · 743

Metamathematical Investigation of Intuitionistic Arithmetic and Analysis

1973 · Troelstra, A. S. · Lecture notes in mathematics · 717

Outline of a Mathematical Theory of Computation

1970 · Dana Scott · Medical Entomology and Zoology · 674

Admissible Sets and Structures

2017 · Jon Barwise · Cambridge University Press eBooks · 671

On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

1938 · A. M. Turing · Proceedings of the London Mathematical Society · 605

General recursive functions of natural numbers

1936 · S. C. Kleene · Mathematische Annalen · 595

Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series))

1997 · William Gasarch · ACM SIGACT News · 583

PDF

Varieties of Constructive Mathematics

1987 · Douglas Bridges, Fred Richman · Cambridge University Press eBooks · 547

Works count: 11,650

Citation count: 134,400