Foundations of Generalized Reversible Computing

被引:19
|
作者
Frank, Michael P. [1 ]
机构
[1] Sandia Natl Labs, Ctr Comp Res, POB 5800,Mail Stop 1322, Albuquerque, NM 87185 USA
来源
关键词
Landauer's Principle; Foundations of reversible computing; Logical reversibility; Reversible logic models; Reversible hardware design; Conditional reversibility; Generalized reversible computing;
D O I
10.1007/978-3-319-59936-6_2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Information loss from a computation implies energy dissipation due to Landauer's Principle. Thus, increasing the amount of useful computational work that can be accomplished within a given energy budget will eventually require increasing the degree to which our computing technologies avoid information loss, i.e., are logically reversible. But the traditional definition of logical reversibility is actually more restrictive than is necessary to avoid information loss and energy dissipation due to Landauer's Principle. As a result, the operations that have traditionally been viewed as the atomic elements of reversible logic, such as Toffoli gates, are not really the simplest primitives that one can use for the design of reversible hardware. Arguably, a complete theoretical framework for reversible computing should provide a more general, parsimonious foundation for practical engineering. To this end, we use a rigorous quantitative formulation of Landauer's Principle to develop the theory of Generalized Reversible Computing (GRC), which precisely characterizes the minimum requirements for a computation to avoid information loss and the consequent energy dissipation, showing that a much broader range of computations are, in fact, reversible than is acknowledged by traditional reversible computing theory. This paper summarizes the foundations of GRC theory and briefly presents a few of its applications.
引用
收藏
页码:19 / 34
页数:16
相关论文
共 50 条
  • [42] ON COMPUTING GENERALIZED INVERSES
    TEWARSON, RP
    [J]. COMPUTING, 1969, 4 (02) : 139 - &
  • [43] On Computing Generalized Backbones
    Previti, Alessandro
    Ignatiev, Alexey
    Jarvisalo, Matti
    Marques-Silva, Joao
    [J]. 2017 IEEE 29TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2017), 2017, : 1050 - 1056
  • [44] Generalized reversible susceptibility tensor
    Dumitru, I
    Stancu, A
    Cimpoesu, D
    Spinu, L
    [J]. JOURNAL OF APPLIED PHYSICS, 2005, 97 (10)
  • [45] Semantic foundations for generalized rewrite theories
    Bruni, Roberto
    Meseguer, Jose
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 360 (1-3) : 386 - 414
  • [46] Axiomatic Foundations of Generalized Qualitative Utility
    Weng, Paul
    [J]. MULTI-DISCIPLINARY TRENDS IN ARTIFICIAL INTELLIGENCE, 2013, 8271 : 305 - 316
  • [47] Convex Foundations for Generalized MaxEnt Models
    Frongillo, Rafael
    Reid, Mark D.
    [J]. BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, MAXENT 2013, 2014, 1636 : 11 - 16
  • [48] ON THE FOUNDATIONS OF GENERALIZED TAYLOR DISPERSION THEORY
    FRANKEL, I
    BRENNER, H
    [J]. JOURNAL OF FLUID MECHANICS, 1989, 204 : 97 - 119
  • [49] Reversible Computing in Debugging of Erlang Programs
    Lanese, Ivan
    Schultz, Ulrik P.
    Ulidowski, Irek
    [J]. IT PROFESSIONAL, 2022, 24 (01) : 74 - 80
  • [50] Reversible Fluxon Logic for Future Computing
    Osborn, Kevin D.
    Wustmann, Waltraut
    [J]. 2019 IEEE INTERNATIONAL SUPERCONDUCTIVE ELECTRONICS CONFERENCE (ISEC), 2019,