Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Reversible_computing> ?p ?o. }

• Reversible_computing abstract "Reversible computing is a model of computing where the computational process to some extent is reversible, i.e., time-invertible. In a computational model that uses transitions from one state of the abstract machine to another, a necessary condition for reversibility is that the relation of the mapping from states to their successors must be one-to-one. Reversible computing is generally considered an unconventional form of computing.There are two major, closely related, types of reversibility that are of particular interest for this purpose: physical reversibility and logical reversibility.A process is said to be physically reversible if it results in no increase in physical entropy; it is isentropic. These circuits are also referred to as charge recovery logic, adiabatic circuits, or adiabatic computing. Although in practice no nonstationary physical process can be exactly physically reversible or isentropic, there is no known limit to the closeness with which we can approach perfect reversibility, in systems that are sufficiently well-isolated from interactions with unknown external environments, when the laws of physics describing the system's evolution are precisely known.Probably the largest motivation for the study of technologies aimed at actually implementing reversible computing is that they offer what is predicted to be the only potential way to improve the energy efficiency of computers beyond the fundamental von Neumann-Landauer limit of kT ln(2) energy dissipated per irreversible bit operation.As was first argued by Rolf Landauer of IBM, in order for a computational process to be physically reversible, it must also be logically reversible. Landauer's principle is the loosely formulated notion that the erasure of n bits of information must always incur a cost of nk ln(2) in thermodynamic entropy. A discrete, deterministic computational process is said to be logically reversible if the transition function that maps old computational states to new ones is a one-to-one function; i.e. the output logical states uniquely defines the input logical states of the computational operation.For computational processes that are nondeterministic (in the sense of being probabilistic or random), the relation between old and new states is not a single-valued function, and the requirement needed to obtain physical reversibility becomes a slightly weaker condition, namely that the size of a given ensemble of possible initial computational states does not decrease, on average, as the computation proceeds forwards.".
• Reversible_computing wikiPageExternalLink en.
• Reversible_computing wikiPageExternalLink WikiHome.
• Reversible_computing wikiPageExternalLink RC05.htm.
• Reversible_computing wikiPageExternalLink pubs.htm.
• Reversible_computing wikiPageExternalLink www.reversible-computation.org.
• Reversible_computing wikiPageExternalLink www.revkit.org.
• Reversible_computing wikiPageID "1539548".
• Reversible_computing wikiPageRevisionID "600170972".
• Reversible_computing hasPhotoCollection Reversible_computing.
• Reversible_computing subject Category:Digital_electronics.
• Reversible_computing subject Category:Models_of_computation.
• Reversible_computing type Assistant109815790.
• Reversible_computing type CausalAgent100007347.
• Reversible_computing type LivingThing100004258.
• Reversible_computing type Model110324560.
• Reversible_computing type ModelsOfComputation.
• Reversible_computing type Object100002684.
• Reversible_computing type Organism100004475.
• Reversible_computing type Person100007846.
• Reversible_computing type PhysicalEntity100001930.
• Reversible_computing type Whole100003553.
• Reversible_computing type Worker109632518.
• Reversible_computing type YagoLegalActor.
• Reversible_computing type YagoLegalActorGeo.
• Reversible_computing comment "Reversible computing is a model of computing where the computational process to some extent is reversible, i.e., time-invertible. In a computational model that uses transitions from one state of the abstract machine to another, a necessary condition for reversibility is that the relation of the mapping from states to their successors must be one-to-one.".
• Reversible_computing label "Calcul réversible".
• Reversible_computing label "Computazione reversibile".
• Reversible_computing label "Reversible computing".
• Reversible_computing label "Reversibles Computing".
• Reversible_computing label "可逆計算".
• Reversible_computing label "可逆計算".
• Reversible_computing sameAs Reversibles_Computing.
• Reversible_computing sameAs Calcul_réversible.
• Reversible_computing sameAs Computazione_reversibile.
• Reversible_computing sameAs 可逆計算.
• Reversible_computing sameAs m.058y76.
• Reversible_computing sameAs Q185410.
• Reversible_computing sameAs Q185410.
• Reversible_computing sameAs Reversible_computing.
• Reversible_computing wasDerivedFrom Reversible_computing?oldid=600170972.
• Reversible_computing isPrimaryTopicOf Reversible_computing.