We give an alternative proof of Bennett's simulation of deterministic Turing machines by reversible ones (machines whose configuration graph has out-degree and in-degree one) with a quadratic loss of space. More importantly, our proof extends this result to nondeterministic Turing machines.

REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS / P. CRESCENZI; C.H. PAPADIMITRIOU. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 143:(1995), pp. 159-165. [10.1016/0304-3975(95)80031-4]

REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS

CRESCENZI, PIERLUIGI;
1995

Abstract

We give an alternative proof of Bennett's simulation of deterministic Turing machines by reversible ones (machines whose configuration graph has out-degree and in-degree one) with a quadratic loss of space. More importantly, our proof extends this result to nondeterministic Turing machines.
1995
143
159
165
P. CRESCENZI; C.H. PAPADIMITRIOU
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/205980
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 7
social impact