Nanomechanical computation - Revision history

Apm: /* Reversible mechanical logic */ added links to yet unwritten page about retractile cascade

2022-01-26T10:23:35Z

Reversible mechanical logic: added links to yet unwritten page about retractile cascade

← Older revision		Revision as of 12:23, 26 January 2022
Line 52:		Line 52:
	One could say one un-computes the intermediate data garbage.		One could say one un-computes the intermediate data garbage.

	This hole process is called a '''retractile cascade'''		This hole process is called a '''[[retractile cascade]]'''

	The energy swings back and forth between the energy storage and the many logic gates.		The energy swings back and forth between the energy storage and the many logic gates.
Line 66:		Line 66:
	The results may be fed back into other yet unevaluated parts of the PLA for a second and further rounds.		The results may be fed back into other yet unevaluated parts of the PLA for a second and further rounds.

	=== Drive for retractile cascade ===		=== Drive for [[retractile cascade]] ===

	Assuming rotative logic a possible method to generate the "bar graph display clock signal" may be like follows:		Assuming rotative logic a possible method to generate the "bar graph display clock signal" may be like follows:

2021-06-24T15:09:30Z

2017-07-19T18:32:16Z

Zuse's Z1: minus newline

← Older revision		Revision as of 20:32, 19 July 2017
Line 93:		Line 93:
	== Zuse's Z1 ==		== Zuse's Z1 ==

	The Z1 was the first and ony ever built truly mechanical computer with von Neumann architecture: ~~<br>~~		The Z1 was the first and ony ever built truly mechanical computer with von Neumann architecture:
	[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>		[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>
	It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]		It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]

2017-07-19T18:31:42Z

Zuse's Z1: removed likely incorrect statement

← Older revision		Revision as of 20:31, 19 July 2017
Line 95:		Line 95:
	The Z1 was the first and ony ever built truly mechanical computer with von Neumann architecture: <br>		The Z1 was the first and ony ever built truly mechanical computer with von Neumann architecture: <br>
	[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>		[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>
	~~Note that Babbages machine was a calculator not a computer!<br>~~
	It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]		It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]

2017-07-19T13:18:22Z

Related: added links to two related pages

← Older revision		Revision as of 15:18, 19 July 2017
Line 123:		Line 123:

	= Related =		= Related =

			* [[Mechanical computation]]
			* [[Reversible data processing]]

	== The chain of reversibility up the levels of abstraction ==		== The chain of reversibility up the levels of abstraction ==

2017-07-16T06:00:46Z

← Older revision		Revision as of 08:00, 16 July 2017
Line 136:		Line 136:
	* [http://www.zyvex.com/nanotech/mechano.html Two Types of Mechanical Reversible Logic]		* [http://www.zyvex.com/nanotech/mechano.html Two Types of Mechanical Reversible Logic]

			[[Category:Information]]
	[[Category:Technology level III]]		[[Category:Technology level III]]

2017-06-21T11:54:35Z

Reversible mechanical logic: removed doubled "the"

← Older revision		Revision as of 13:54, 21 June 2017
Line 57:		Line 57:
	Tree like distributed though mechanical differenials. ['''Todo:''' other option?]		Tree like distributed though mechanical differenials. ['''Todo:''' other option?]

	If the negated bits are always computated in parallel ~~the~~ the energy stored in the springs in the gates when in evaluated state is always the same.		If the negated bits are always computated in parallel the energy stored in the springs in the gates when in evaluated state is always the same.
	[can each rod pair made reversible independently?]		[can each rod pair made reversible independently?]
	Swing overshoot can be made minimal. ['''Todo:''' explain in more detail]		Swing overshoot can be made minimal. ['''Todo:''' explain in more detail]

2015-05-29T15:32:24Z

Concrete implementations

← Older revision		Revision as of 17:32, 29 May 2015
Line 83:		Line 83:

	= Concrete implementations =		= Concrete implementations =

			== Various approaches / proposals ==

	* reciprocative rod logic		* reciprocative rod logic
Line 91:		Line 93:
	== Zuse's Z1 ==		== Zuse's Z1 ==

	The first and ony ever built truly mechanical computer ~~was the Z1~~:		The Z1 was the first and ony ever built truly mechanical computer with von Neumann architecture: <br>
	[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>		[https://www.youmagine.com/design_ideas/reconstruction-of-the-z1 (link collection)] <br>
			Note that Babbages machine was a calculator not a computer!<br>
	It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]		It does four step pipelining to be able to deliver practical throughput but this seems to make it irreversible ['''Todo:''' investigate this]

2015-05-29T15:27:45Z

added some stub points

← Older revision		Revision as of 17:27, 29 May 2015
Line 109:		Line 109:
	These can be used in a digital fashion (much better) that is one enforces inputs and outputs to discrete values.		These can be used in a digital fashion (much better) that is one enforces inputs and outputs to discrete values.
	These might be more compact tnan single bit representations (or might not).		These might be more compact tnan single bit representations (or might not).
	Conversion back and forth to single bit representation will take additional space.		Conversion back and forth to single bit representation will take additional space.

	~~== Related ==~~		['''Todo:''' link old video]

	=== The chain of reversibility up the levels of abstraction ===		= Logic circuits in general =

			* Ternary logic: It is not so hard to implement mechanically - it seems that pros an cons pretty much balance each other out. ['''Todo:''' recheck a certain researchers work and put more detailed results here]
			* non naive multiplier networks are non trivial ['''Todo:''' check whether a mechanical demo model can be built from mechanical gates without too much effort]
			* peadic numbers: IIRC There is a link to arbitrary precision computing IIRC

			= Related =

			== The chain of reversibility up the levels of abstraction ==

	There's a link		There's a link

2015-05-29T15:22:27Z

analog+digital; abstraction reversibility chain

@@ Line 106: / Line 106: @@
 * gear ratios act as fixed ratio multiplication
 * there's a linkage mechanism for continuous multiplication
 = External links =