Reversible computation - Revision history

Apm at 11:09, 2 September 2024

2024-09-02T11:09:17Z

← Older revision		Revision as of 13:09, 2 September 2024
Line 1:		Line 1:
	[[File:Principles of Adiabatic Processes powerpoint ppt presentation Slide29 Possible Adiabatic Transitions.png\|400px\|thumb\|right\|'''This is how one switches a bit from 0 to 1 or vice-versa losslessly and thus the basis of reversible computing.''' Red arrows are lossy/dissipative/irreversible well merging processes. Follow the spiral of green arrows to go from a 0 to a 1 (or vice versa) in a lossless/nondissipative/reversible/adiabatic manner.]]		[[File:Principles of Adiabatic Processes powerpoint ppt presentation Slide29 Possible Adiabatic Transitions.png\|400px\|thumb\|right\|'''This is how one switches a bit from 0 to 1 or vice-versa losslessly and thus the basis of reversible computing.''' Red arrows are lossy/dissipative/irreversible well merging processes. Follow the spiral of green arrows to go from a 0 to a 1 (or vice versa) in a lossless/nondissipative/reversible/adiabatic manner. – See also: [[Well merging]].]]

	== The extremely simple but too naive approach ==		== The extremely simple but too naive approach ==

Apm: added illustrative image

2024-09-02T11:07:49Z

added illustrative image

← Older revision		Revision as of 13:07, 2 September 2024
Line 1:		Line 1:
	~~{{stub}}~~		[[File:Principles of Adiabatic Processes powerpoint ppt presentation Slide29 Possible Adiabatic Transitions.png\|400px\|thumb\|right\|'''This is how one switches a bit from 0 to 1 or vice-versa losslessly and thus the basis of reversible computing.''' Red arrows are lossy/dissipative/irreversible well merging processes. Follow the spiral of green arrows to go from a 0 to a 1 (or vice versa) in a lossless/nondissipative/reversible/adiabatic manner.]]

	== The extremely simple but too naive approach ==		== The extremely simple but too naive approach ==

Apm: /* Related / added Well merging

2024-09-02T10:51:31Z

Related: added * Well merging

← Older revision		Revision as of 12:51, 2 September 2024
Line 75:		Line 75:
	== Related ==		== Related ==

			* [[Well merging]]
			----
	* '''[[Nanomechanical computation]]'''		* '''[[Nanomechanical computation]]'''
	* '''[[Quantum computation]]''', [[Non mechanical technology path#quantum computation]]		* '''[[Quantum computation]]''', [[Non mechanical technology path#quantum computation]]

Apm: /* Related */ added link to et unwritten page Compute architectures

2024-09-02T06:52:23Z

Related: added link to et unwritten page Compute architectures

← Older revision		Revision as of 08:52, 2 September 2024
Line 87:		Line 87:
	* [[Low speed efficiency limit]]		* [[Low speed efficiency limit]]
	* [[Formal system]]s		* [[Formal system]]s
			----
			* [[Compute architectures]]

	== External links ==		== External links ==

Apm: /* Related */ made the link to Dissipation sharing stick out more prominently

2023-11-27T16:11:12Z

Related: made the link to Dissipation sharing stick out more prominently

← Older revision		Revision as of 18:11, 27 November 2023
Line 83:		Line 83:
	----		----
	* [[Energy recuperation]]		* [[Energy recuperation]]
	* Sharing of energy devaluations for a defined arrow of time in the mechanosynthesis in nanofactories: [[Dissipation sharing]]		* Sharing of energy devaluations for a defined arrow of time in the mechanosynthesis in nanofactories: <br>'''[[Dissipation sharing]]'''
	* [[Reversible actuation]]		* [[Reversible actuation]]
	* [[Low speed efficiency limit]]		* [[Low speed efficiency limit]]

Apm: /* Retractile cascades and reversible computation trees */ added link to yet unwritten page about retractile cascade

2022-01-26T10:22:05Z

Retractile cascades and reversible computation trees: added link to yet unwritten page about retractile cascade

← Older revision		Revision as of 12:22, 26 January 2022
Line 14:		Line 14:
	Te main way to get space back is to store the (intermediate) results of a computation and then "uncompute" the path to the the result. <br>		Te main way to get space back is to store the (intermediate) results of a computation and then "uncompute" the path to the the result. <br>
	The "uncomputation" recuperates the Helmholtz free energy associated with the bits of information that needed to be temporarily stored during the computation. <br>		The "uncomputation" recuperates the Helmholtz free energy associated with the bits of information that needed to be temporarily stored during the computation. <br>
	This computation then storing then uncomputation is called a "retractile cascade".		This computation then storing then uncomputation is called a "[[retractile cascade]]".

	Tightly nesting retractile cascaded leads to a reversible computation tree. <br>		Tightly nesting retractile cascaded leads to a reversible computation tree. <br>

Apm: added Category:Programming

2021-09-26T08:38:16Z

added Category:Programming

← Older revision		Revision as of 10:38, 26 September 2021
Line 104:		Line 104:
	[[Category:Information]]		[[Category:Information]]
	[[Category:Thermal]]		[[Category:Thermal]]
			[[Category:Programming]]

	== TODO Notes ==		== TODO Notes ==

Apm: added == Relation of reversible computation to quantum computation ==

2021-06-23T13:42:28Z

added == Relation of reversible computation to quantum computation ==

← Older revision		Revision as of 15:42, 23 June 2021
Line 38:		Line 38:
	'''The main benefit of of sticking to full on true reversible computation is extremely low power consumption.'''		'''The main benefit of of sticking to full on true reversible computation is extremely low power consumption.'''

	== Relation of reversible computation to purely functional programming ==		== Relation of reversible computation to purely functional programming ==

	[[purely functional programming]] is a weaker requirement than reversible computation though since:		[[purely functional programming]] is a weaker requirement than reversible computation though since:
Line 47:		Line 47:
	* one looses the property of low power consumption.		* one looses the property of low power consumption.
	* one (probably) lifts the fundamental limit of being fundamentally weaker than irreversible programming (here imperative programming) <br>– there is still an experienced higher difficulty though		* one (probably) lifts the fundamental limit of being fundamentally weaker than irreversible programming (here imperative programming) <br>– there is still an experienced higher difficulty though

			== Relation of reversible computation to quantum computation ==

			Reversible computation is an absolutely necessary prerequisite for [[quantum computation]] stretches between state collapsing measurements from the outside. <br>
			A destructive overwrite of a specific bit would amount to a collapse of the state and a collapse <br>
			of the local "micro-multiverse" that constitutes the quantum computation.

			After the code for the quantum computation is set up and is set in motion it's hand's off. <br>
			Of course parts of the running code can (and must be able to) influence other parts of the running code. <br>
			But such hidden internal internal interactions just splits up the quantum parallel entanglement of states even further. <br>
			All possibilities are kept till the final measurement from our single one common reality (our quantum mechanical frame of reference) <br>
			That measurement from outside (which may collapse the computation partially or completely) breaks the streak of reversibility.

	== Energy swinging frequency ==		== Energy swinging frequency ==

Apm: massive extension

2021-06-23T13:23:39Z

massive extension

@@ Line 1: / Line 1: @@
 {{stub}}
-*note reversible cascades
+== The extremely simple but too naive approach ==
-*why functional programming matters for AP technology
+Any logic gate can be naively made into a reversible one by just not throwing away the inputs. <br>
-*reversible 1:1 IO mapping - pure functions
+That strategy is obviously using up an ever growing and impractically large amount of data storage space though. <br>
-*low and high level programming languages
+To avoid running out of memory (to keep space complexity low) the approach must be changed.
-* classical reversible gates
+Logic gates and circuitry can be optimized (Toffoli gate ...) but this alone does not change much. <br>
-== Related ==
+[[purely functional programming]] is a weaker requirement than reversible computation though since:
-* [[nanomechanical computation]]
+Through that weaker requirement of only higher level logical reversibility:
-* [[quantum computation]], [[non mechanical technology path#quantum computation]]
+* one looses the property of low power consumption.
-* [[mechanical computation]]
+* one (probably) lifts the fundamental limit of being fundamentally weaker than irreversible programming (here imperative programming) <br>– there is still an experienced higher difficulty though
 == Energy swinging frequency ==
@@ Line 35: / Line 63: @@
 == Related ==
-* [[Nanomechanical computation]]
+* '''[[Nanomechanical computation]]'''
-* [[Reversible actuation]]
+* '''[[Quantum computation]]''', [[Non mechanical technology path#quantum computation]]
 * [[Energy recuperation]]
 * Sharing of energy devaluations for a defined arrow of time in the mechanosynthesis in nanofactories: [[Dissipation sharing]]
 * [[Low speed efficiency limit]]
 * [[Formal system]]s
 == External links ==
@@ Line 60: / Line 92: @@
 [[Category:Information]]
 [[Category:Thermal]]

Apm: added link to yet unwritten page quantum computation

2021-06-23T12:13:24Z

added link to yet unwritten page quantum computation

← Older revision		Revision as of 14:13, 23 June 2021
Line 14:		Line 14:
	* classical reversible gates		* classical reversible gates

	~~related:~~		== Related ==

	* [[nanomechanical computation]]		* [[nanomechanical computation]]
	* [[non mechanical technology path#~~quantum computation\|~~quantum computation]]		* [[quantum computation]], [[non mechanical technology path#quantum computation]]
	* [[mechanical computation]]		* [[mechanical computation]]

Line 55:		Line 56:
	* Wikipedia: [http://en.wikipedia.org/wiki/Reversible_logic reversible computing]		* Wikipedia: [http://en.wikipedia.org/wiki/Reversible_logic reversible computing]
	----		----
	* Wikimedia commons (de): [https://commons.wikimedia.org/wiki/File:Kausale_Abh%C3%A4ngigkeit.svg causal depencency cone] {{~~todo~~\|integrate that image (or a similar translated one) here}}		* Wikimedia commons (de): [https://commons.wikimedia.org/wiki/File:Kausale_Abh%C3%A4ngigkeit.svg causal depencency cone] {{wikitodo\|integrate that image (or a similar translated one) here}}

	[[Category:Information]]		[[Category:Information]]
	[[Category:Thermal]]		[[Category:Thermal]]