On reversible Turing machines and their function universality


We provide a treatment of the reversible Turing machines (RTMs) under a strict function semantics. Unlike many existing reversible computation models, we distinguish strictly between computing the function $$\lambda x.f(x)$$ λ x . f ( x ) and computing the function $$\lambda x. (x, f(x))$$ λ x . ( x , f ( x ) ) , or other injective embeddings of f. We… (More)
DOI: 10.1007/s00236-015-0253-y


11 Figures and Tables

Slides referencing similar topics