Reversible Turing Machines

Reversible Turing Machine is a type of Turing machine in which every configuration has at most one predecessor, ensuring that the computational process can be uniquely traced backward in time, thereby satisfying the principle of reversibility in its transition function.

59

Publications

7.1K

Citations

95

Authors

61

Institutions

Publications per year

2017–2026

3

Authors

95

  1. KM
    Kenichi Morita

    Hiroshima University, Japan

    5 publications · 300 citations

    5

    h-index

  2. CH
    Charles H. Bennett

    IBM (United States), United States

    4 publications · 1.5K citations

    4

    h-index

  3. AD
    Alexis De Vos

    Ghent University, Belgium

    3 publications · 95 citations

    3

    h-index

  4. PV
    Paul Vitányi

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 107 citations

    3

    h-index

  5. PC
    Pierluigi Crescenzi

    University of Florence, Italy

    2 publications · 28 citations

    2

    h-index

1–5 of 95

Venues

  1. Theoretical Computer Science

    14 publications · 689 citations

    12

    h-index

  2. Journal of Computer and System Sciences

    6 publications · 192 citations

    6

    h-index

  3. IBM Journal of Research and Development

    3 publications · 4.2K citations

    3

    h-index

  4. Bulletin of Mathematical Biology

    2 publications · 31 citations

    2

    h-index

  5. SIAM Journal on Computing

    2 publications · 425 citations

    2

    h-index

1–5