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

Authors

25

  1. ÁR
    Álvaro Romero–Jiménez

    Universidad de Sevilla, Spain

    1 publications · 12 citations

    1

    h-index

  2. JC
    John Cocke

    IBM Research - Thomas J. Watson Research Center, United States

    1 publications · 95 citations

    1

    h-index

  3. LR
    Lev Rozansky

    University of North Carolina at Chapel Hill, United States

    1 publications · 12 citations

    1

    h-index

  4. MJ
    Mario J. Pérez-Jímenez

    Universidad de Sevilla, Spain

    1 publications · 12 citations

    1

    h-index

  5. MC
    Matthew Cook

    Australian National University, Australia

    1 publications · 689 citations

    1

    h-index

1–5 of 25

Venues

  1. Theoretical Computer Science

    2 publications · 148 citations

    2

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 26 citations

    2

    h-index

  3. 1

    h-index

  4. Journal of Mathematical Physics

    1 publications · 101 citations

    1

    h-index

  5. Complex Systems

    1 publications · 689 citations

    1

    h-index

1–5