Computational Equivalence
Computational Equivalence is the thesis that any two computational models are capable of simulating each other if they can both emulate a universal Turing machine, thereby exhibiting the same class of computable functions.
76
Publications
4.5K
Citations
121
Authors
78
Institutions
Publications per year
2017–2026
7
Parents
76
Two-Tape Simulation of Multitape Turing Machines
F. C. Hennie, Richard E. Stearns · Journal of the ACM · 1966 · 287 citations · Full text
Arnold Schönhage · SIAM Journal on Computing · 1980 · 238 citations
1–5 of 76
121
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 121
78
Stanford University
Stanford, United States
4 h-index
8 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
4 publications
433 citations
University of Luxembourg
Luxembourg, Luxembourg
3 h-index
4 publications
51 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
4 publications
270 citations
Microsoft (United States)
Redmond, United States
3 h-index
3 publications
109 citations

Cornell University
Ithaca, United States
3 h-index
4 publications
57 citations

University of Bristol
Bristol, United Kingdom
3 h-index
3 publications
138 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
3 publications
102 citations
1–8 of 78
MSCS · 5 publications · 122 citations
5
h-index
3 publications · 490 citations
3
h-index
3 publications · 68 citations
3
h-index
JACM · 3 publications · 536 citations
3
h-index
2 publications · 49 citations
2
h-index
1–5