Turing Machine Computability
Turing Machine Computability is the formal property of a function or problem being solvable by a Turing machine, distinguishing it as the foundational criterion for effective computability in mathematical logic and theoretical computer science.
356
Publications
29.4K
Citations
484
Authors
286
Institutions
Publications per year
2017–2026
45
Variants
Turing Computability
Parents
356
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1969 · 917 citations · Full text
On the Length of Programs for Computing Finite Binary Sequences
Gregory J. Chaitin · Journal of the ACM · 1966 · 912 citations · Full text
1–5 of 356
484
12
h-index
7
h-index
7
h-index
7
h-index
5
h-index
1–5 of 484
286
Technical University of Munich
Munich, Germany
13 h-index
23 publications
470 citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
13 publications
922 citations
Munich Center for Quantum Science and Technology
Munich, Germany
9 h-index
9 publications
221 citations

University of Toronto
Toronto, Canada
8 h-index
13 publications
342 citations
Princeton University
Princeton, United States
8 h-index
8 publications
191 citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
8 publications
321 citations
Hebrew University of Jerusalem
Jerusalem, Israel
7 h-index
10 publications
468 citations

University of Canterbury
Christchurch, New Zealand
7 h-index
10 publications
704 citations
1–8 of 286
13 publications · 1.1K citations
12
h-index
JACM · 13 publications · 2.8K citations
11
h-index
CRO · 7 publications · 873 citations
7
h-index
Repository · 7 publications · 103 citations
7
h-index
7 publications · 511 citations
7
h-index
1–5