Making programs reversible with minimal extra data
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Making programs reversible with minimal extra data. / Glück, Robert; Yokoyama, Tetsuo.
I: New Generation Computing, Bind 40, Nr. 2, 2022, s. 467-480.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Making programs reversible with minimal extra data
AU - Glück, Robert
AU - Yokoyama, Tetsuo
N1 - Publisher Copyright: © 2022, Ohmsha, Ltd. and Springer Japan KK, part of Springer Nature.
PY - 2022
Y1 - 2022
N2 - Reversible computing is an unconventional computing paradigm that comes with specific challenges. One of the important questions is the existence of reversible programs with minimal extra output (garbage data). To answer this question for programs that implement partial functions over countable domains, we introduce an order on infinite garbage sets and a notion of minimality. To this end, we present two methods for functions specified by decidable and semi-decidable predicates. Both methods are universal, which means they work for all programs specified by the predicates. They cover Bennett’s classic input-erasing reversible computation of injective functions. Hence, any program written in a Turing-complete programming language can be implemented with g-minimal garbage in an r-Turing-complete reversible programming language. This generality comes at the cost of a considerable runtime due to the generate-and-test approach.
AB - Reversible computing is an unconventional computing paradigm that comes with specific challenges. One of the important questions is the existence of reversible programs with minimal extra output (garbage data). To answer this question for programs that implement partial functions over countable domains, we introduce an order on infinite garbage sets and a notion of minimality. To this end, we present two methods for functions specified by decidable and semi-decidable predicates. Both methods are universal, which means they work for all programs specified by the predicates. They cover Bennett’s classic input-erasing reversible computation of injective functions. Hence, any program written in a Turing-complete programming language can be implemented with g-minimal garbage in an r-Turing-complete reversible programming language. This generality comes at the cost of a considerable runtime due to the generate-and-test approach.
KW - Garbage data
KW - Injectivization
KW - Reversibilization
KW - Reversible computing
KW - Reversible programming
U2 - 10.1007/s00354-022-00169-z
DO - 10.1007/s00354-022-00169-z
M3 - Journal article
AN - SCOPUS:85133457724
VL - 40
SP - 467
EP - 480
JO - New Generation Computing
JF - New Generation Computing
SN - 0288-3635
IS - 2
ER -
ID: 314299379