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
Parents
59
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Time/Space Trade-Offs for Reversible Computation
Charles H. Bennett · SIAM Journal on Computing · 1989 · 411 citations
1–5 of 59
95
5
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 95
61

Centre National de la Recherche Scientifique
Paris, France
4 h-index
8 publications
278 citations
Université Paris Cité
Paris, France
4 h-index
5 publications
158 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
4 publications
4.3K citations

Hiroshima University
Hiroshima, Japan
3 h-index
3 publications
215 citations
IBM (United States)
Armonk, United States
3 h-index
3 publications
961 citations
Institut de Mathématiques de Marseille
Marseille, France
3 h-index
3 publications
109 citations
University of Copenhagen
Copenhagen, Denmark
2 h-index
4 publications
282 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
3 publications
105 citations
1–8 of 61
14 publications · 689 citations
12
h-index
6 publications · 192 citations
6
h-index
3 publications · 4.2K citations
3
h-index
2 publications · 31 citations
2
h-index
2 publications · 425 citations
2
h-index
1–5