Retractile cascade: Difference between revisions

From apm
Jump to navigation Jump to search
basic page
 
 
Line 29: Line 29:
* [[Reversibel computing]]
* [[Reversibel computing]]
* [[Rod logic]]
* [[Rod logic]]
----
* [[Constant speed source and position control]] (avoiding irreversible snaps)

Latest revision as of 12:00, 15 December 2025

This article is a stub. It needs to be expanded.

The principle works roughly in terse summary description like such:

★ At core:
– First normal forward computation, but reversible, that is: Keeping all the inputs around.
– Then saving the output using a reversible latch.
– Then then backwards computation (aka "uncomputation") to free up the logic gates for further compute again.

★ Then do this process in a hierarchical fashion,
… where the data stored in the latches server as the inputs of further such processes.

★ Furthermore there is optimization potential in compressing this (somewhat fractal) hierarchical process in space and time.
… Initial optimizations are not entirely trivial but straightforward and self suggesting (at least in retrospect).

(wiki-TODO: From the presentation-slide-decks linked at page reversible computing, add relevant slides to the three points above.)

Possible illustration

Rod logic may especially lend itself to educational illustration of the process.
As in the mechanical electrical analogies
– charges of digital bits are mapped to positions
– currents are mapped to speeds and
– voltages are mapped to to forces.
– And most importantly: Irreversible energy dissipative deletions of bits are mapped to unconstrained snaps.

Related