Turing Machine Characterizations
Turing Machine Characterizations is a theoretical framework that formally defines and classifies the computational capabilities and limitations of Turing machines by identifying invariant properties across equivalent models of computation.
113
Publications
14.5K
Citations
167
Authors
107
Institutions
Publications per year
2017–2026
8
Parents
113
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 113
167
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 167
107
University of Illinois Chicago
Chicago, United States
3 h-index
3 publications
114 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
3 publications
167 citations
Munich Center for Quantum Science and Technology
Munich, Germany
3 h-index
3 publications
98 citations
Technical University of Munich
Munich, Germany
3 h-index
4 publications
109 citations

University of Minnesota
Minneapolis, United States
3 h-index
4 publications
147 citations

University of Bologna
Bologna, Italy
2 h-index
2 publications
25 citations
University of Chicago
Chicago, United States
2 h-index
2 publications
72 citations

Swansea University
Swansea, United Kingdom
2 h-index
4 publications
92 citations
1–8 of 107
7 publications · 686 citations
7
h-index
JACM · 5 publications · 2.1K citations
5
h-index
5 publications · 316 citations
5
h-index
CRO · 5 publications · 710 citations
5
h-index
4 publications · 122 citations
4
h-index
1–5