Bennett's logical reversibility
E413119
Bennett's logical reversibility is a concept in computation theory stating that computational processes can be designed so that each step is logically reversible, allowing information to be recovered and, in principle, computation to occur without energy dissipation.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bennett's logical reversibility canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4091805 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bennett's logical reversibility Context triple: [Landauer's principle, relatedTo, Bennett's logical reversibility]
-
A.
“Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
-
D.
The Universal Computer
The Universal Computer is a book by mathematician and logician Martin Davis that traces the history and development of the concept of computation and the universal Turing machine.
-
E.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bennett's logical reversibility Target entity description: Bennett's logical reversibility is a concept in computation theory stating that computational processes can be designed so that each step is logically reversible, allowing information to be recovered and, in principle, computation to occur without energy dissipation.
-
A.
“Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
-
D.
The Universal Computer
The Universal Computer is a book by mathematician and logician Martin Davis that traces the history and development of the concept of computation and the universal Turing machine.
-
E.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
concept in computation theory
ⓘ
principle of reversible computation ⓘ |
| addresses | energy cost of information erasure ⓘ |
| aimsAt | making computation thermodynamically reversible in the limit ⓘ |
| appliesTo |
classical computation
ⓘ
quantum computation ⓘ |
| assumes | idealized, noise-free computational processes ⓘ |
| clarifies | distinction between logical and physical irreversibility ⓘ |
| connectedTo |
Maxwell's demon thought experiment
ⓘ
surface form:
Maxwell's demon thought experiments
entropy in information processing ⓘ |
| contrastsWith |
logically irreversible computation
ⓘ
operations like AND, OR, and ERASE that lose information ⓘ |
| coreIdea |
computations can be designed so that each state has a unique predecessor
ⓘ
information is never destroyed during the computation ⓘ |
| enables |
reversible Turing machine constructions
ⓘ
reversible simulation of irreversible computations ⓘ |
| field |
information theory
ⓘ
Theoretical Computer Science ⓘ
surface form:
theoretical computer science
thermodynamics of computation ⓘ |
| formalizedIn | reversible Turing machine models ⓘ |
| hasConsequence |
computation can in principle be performed with arbitrarily low energy dissipation
ⓘ
minimum energy cost is associated with information erasure, not with reversible operations ⓘ |
| hasKeyClaim | logical irreversibility is the source of fundamental heat generation in computation ⓘ |
| historicalContext | developed in the 1970s ⓘ |
| implies |
any irreversible computation can be embedded in a larger reversible one
ⓘ
in principle computation can occur without fundamental energy dissipation ⓘ |
| influenced |
design of reversible logic gates
ⓘ
development of reversible computing architectures ⓘ energy-efficient algorithm design ⓘ |
| involves | storing and later uncomputing intermediate results ⓘ |
| motivatedBy |
desire to avoid entropy increase from computation
ⓘ
thermodynamic reversibility ⓘ |
| namedAfter | Charles H. Bennett ⓘ |
| relatedTo |
Fredkin gate
ⓘ
Landauer's principle ⓘ Toffoli gate ⓘ adiabatic computing ⓘ low-entropy computation ⓘ |
| requires |
no loss of information in any computational step
ⓘ
one-to-one mapping between input and output states ⓘ |
| statedAs | every step of a computation can be made logically reversible ⓘ |
| supports |
possibility of asymptotically zero-energy computation in theory
ⓘ
view that energy dissipation is not fundamentally tied to computation itself ⓘ |
| usedIn |
analysis of thermodynamic cost of computation
ⓘ
design of low-power computing systems ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Bennett's logical reversibility Description of subject: Bennett's logical reversibility is a concept in computation theory stating that computational processes can be designed so that each step is logically reversible, allowing information to be recovered and, in principle, computation to occur without energy dissipation.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.