Proof Of Universality
Proof of Universality is a theoretical demonstration that a particular computational model or system can simulate any Turing machine, thereby establishing its computational equivalence to a universal Turing machine within the framework of the Church-Turing Thesis.
15
Publications
1.3K
Citations
25
Authors
19
Institutions
Publications per year
2017–2026
2
Parents
15
Universality in Elementary Cellular Automata
Matthew Cook · Complex Systems · 2004 · 689 citations · Full text
Universal quantum computation with metaplectic anyons
Journal of Mathematical Physics · 2015 · 101 citations · Full text
Computing, Computer Science, Physics +12
Universality of Tag Systems with <i>P</i> = 2
John Cocke, Marvin Minsky · Journal of the ACM · 1964 · 95 citations
1–5 of 15
25
1
h-index
IBM Research - Thomas J. Watson Research Center, United States
1 publications · 95 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 25
19
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
101 citations

University of Warsaw
Warsaw, Poland
1 h-index
1 publications
22 citations

Indian Institute of Technology Bombay
Mumbai, India
1 h-index
1 publications
26 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
95 citations
University of California, Berkeley
Berkeley, United States
1 h-index
2 publications
68 citations

Western University
London, Canada
1 h-index
1 publications
122 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
14 citations

Australian National University
Canberra, Australia
1 h-index
1 publications
14 citations
1–8 of 19
2 publications · 148 citations
2
h-index
Repository · 2 publications · 26 citations
2
h-index
1 publications · 34 citations
1
h-index
1 publications · 101 citations
1
h-index
1 publications · 689 citations
1
h-index
1–5