Come ti sconfiggo l'entropia informazionale

Automi cellulari e computazione reversibile

Translated title of the contribution: How to Beat Informational Entropy: Cellular Automata and Reversible Computation

Francesco Berto, Jacopo Tagliabue, Gabriele Rossi

Research output: Contribution to journalArticle

2 Downloads (Pure)

Abstract

«There's Plenty of Room at the Bottom», said the title of Richard Feynman's 1959 visionary conference at the California Institute of Technology. Fifty years on, the development of nanotechnologies has led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models - one still missing is reversibility. The dynamical laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10-21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. As nanotechnologies evolve, it is reasonable to conjecture that this discrepancy is to become a decisive technical issue the future of computation. This paper addresses the problem drawing on Fredkin's Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, ontologically satisfying the axioms of classical, atomistic mereology. It is shown that a world made only of atoms in a lattice, capable of instantiating a minimal number of well-defined basic properties, allows for the strongest isomorphism between matter and information. The chosen model is a cellular automaton (CA) with strongly reversible dynamics, capable of retaining perfect memory of the totality of information present at the beginning of the universe. It is shown that such a CA can implement the Boolean logical operations and the other building bricks of computation: it may be used to develop and host all-purpose computers - universal Turing machines capable of computing, by Turing's Thesis, anything computable. Our model is therefore a candidate for the realization of high-performance computational systems, capable of exploiting the resources of the physical world in the most efficient way, for they can host logical circuits with internal energy dissipation virtually close to zero.
Original languageItalian
Pages (from-to)427-446
Number of pages19
JournalSistemi Intelligenti
Volume3
Publication statusPublished - Dec 2011

Fingerprint

Nanotechnology
Cellular automata
Entropy
entropy
Automatic Data Processing
Costs and Cost Analysis
nanotechnology
Energy dissipation
Physics
Brick buildings
information processing
Thermodynamics
Turing machines
Technology
energy
computer scientist
Temperature
totality
institute of technology
Costs

Keywords

  • Cellular automata
  • Reversible computation
  • non-standard computation

Cite this

Come ti sconfiggo l'entropia informazionale : Automi cellulari e computazione reversibile. / Berto, Francesco; Tagliabue, Jacopo; Rossi, Gabriele.

In: Sistemi Intelligenti, Vol. 3, 12.2011, p. 427-446.

Research output: Contribution to journalArticle

Berto, Francesco ; Tagliabue, Jacopo ; Rossi, Gabriele. / Come ti sconfiggo l'entropia informazionale : Automi cellulari e computazione reversibile. In: Sistemi Intelligenti. 2011 ; Vol. 3. pp. 427-446.
@article{86ecc5d191204acd98324e7a0c5b5dab,
title = "Come ti sconfiggo l'entropia informazionale: Automi cellulari e computazione reversibile",
abstract = "«There's Plenty of Room at the Bottom», said the title of Richard Feynman's 1959 visionary conference at the California Institute of Technology. Fifty years on, the development of nanotechnologies has led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models - one still missing is reversibility. The dynamical laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10-21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. As nanotechnologies evolve, it is reasonable to conjecture that this discrepancy is to become a decisive technical issue the future of computation. This paper addresses the problem drawing on Fredkin's Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, ontologically satisfying the axioms of classical, atomistic mereology. It is shown that a world made only of atoms in a lattice, capable of instantiating a minimal number of well-defined basic properties, allows for the strongest isomorphism between matter and information. The chosen model is a cellular automaton (CA) with strongly reversible dynamics, capable of retaining perfect memory of the totality of information present at the beginning of the universe. It is shown that such a CA can implement the Boolean logical operations and the other building bricks of computation: it may be used to develop and host all-purpose computers - universal Turing machines capable of computing, by Turing's Thesis, anything computable. Our model is therefore a candidate for the realization of high-performance computational systems, capable of exploiting the resources of the physical world in the most efficient way, for they can host logical circuits with internal energy dissipation virtually close to zero.",
keywords = "Cellular automata, Reversible computation, non-standard computation",
author = "Francesco Berto and Jacopo Tagliabue and Gabriele Rossi",
year = "2011",
month = "12",
language = "Italian",
volume = "3",
pages = "427--446",
journal = "Sistemi Intelligenti",
issn = "1120-9550",
publisher = "Il Mulino publishing house",

}

TY - JOUR

T1 - Come ti sconfiggo l'entropia informazionale

T2 - Automi cellulari e computazione reversibile

AU - Berto, Francesco

AU - Tagliabue, Jacopo

AU - Rossi, Gabriele

PY - 2011/12

Y1 - 2011/12

N2 - «There's Plenty of Room at the Bottom», said the title of Richard Feynman's 1959 visionary conference at the California Institute of Technology. Fifty years on, the development of nanotechnologies has led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models - one still missing is reversibility. The dynamical laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10-21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. As nanotechnologies evolve, it is reasonable to conjecture that this discrepancy is to become a decisive technical issue the future of computation. This paper addresses the problem drawing on Fredkin's Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, ontologically satisfying the axioms of classical, atomistic mereology. It is shown that a world made only of atoms in a lattice, capable of instantiating a minimal number of well-defined basic properties, allows for the strongest isomorphism between matter and information. The chosen model is a cellular automaton (CA) with strongly reversible dynamics, capable of retaining perfect memory of the totality of information present at the beginning of the universe. It is shown that such a CA can implement the Boolean logical operations and the other building bricks of computation: it may be used to develop and host all-purpose computers - universal Turing machines capable of computing, by Turing's Thesis, anything computable. Our model is therefore a candidate for the realization of high-performance computational systems, capable of exploiting the resources of the physical world in the most efficient way, for they can host logical circuits with internal energy dissipation virtually close to zero.

AB - «There's Plenty of Room at the Bottom», said the title of Richard Feynman's 1959 visionary conference at the California Institute of Technology. Fifty years on, the development of nanotechnologies has led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models - one still missing is reversibility. The dynamical laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final states. On the other hand, as von Neumann already conjectured, irreversible information processing is expensive: to erase a single bit of information costs ~3 × 10-21 joules at room temperature. Information entropy is a thermodynamic cost, to be paid in non-computational energy dissipation. As nanotechnologies evolve, it is reasonable to conjecture that this discrepancy is to become a decisive technical issue the future of computation. This paper addresses the problem drawing on Fredkin's Finite Nature hypothesis: the ultimate nature of the universe is discrete and finite, ontologically satisfying the axioms of classical, atomistic mereology. It is shown that a world made only of atoms in a lattice, capable of instantiating a minimal number of well-defined basic properties, allows for the strongest isomorphism between matter and information. The chosen model is a cellular automaton (CA) with strongly reversible dynamics, capable of retaining perfect memory of the totality of information present at the beginning of the universe. It is shown that such a CA can implement the Boolean logical operations and the other building bricks of computation: it may be used to develop and host all-purpose computers - universal Turing machines capable of computing, by Turing's Thesis, anything computable. Our model is therefore a candidate for the realization of high-performance computational systems, capable of exploiting the resources of the physical world in the most efficient way, for they can host logical circuits with internal energy dissipation virtually close to zero.

KW - Cellular automata

KW - Reversible computation

KW - non-standard computation

M3 - Article

VL - 3

SP - 427

EP - 446

JO - Sistemi Intelligenti

JF - Sistemi Intelligenti

SN - 1120-9550

ER -