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

Authors

121

  1. SH
    Stevan Harnad

    University of Southampton, United Kingdom

    4 publications · 114 citations

    4

    h-index

  2. SS
    Sartaj Sahni

    University of Florida, United States

    2 publications · 52 citations

    2

    h-index

  3. MB
    Mark Bickford

    Cornell University, United States

    2 publications · 28 citations

    2

    h-index

  4. VR
    Vincent Rahli

    Cornell University, United States

    2 publications · 28 citations

    2

    h-index

  5. FH
    Fritz Henglein

    University of Copenhagen, Denmark

    2 publications · 32 citations

    2

    h-index

1–5 of 121

Venues

  1. Mathematical Structures in Computer Science

    MSCS · 5 publications · 122 citations

    5

    h-index

  2. SIAM Journal on Computing

    3 publications · 490 citations

    3

    h-index

  3. Theoretical Computer Science

    3 publications · 68 citations

    3

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 536 citations

    3

    h-index

  5. Artificial Life

    2 publications · 49 citations

    2

    h-index

1–5