Jump to content

Calculating Space

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 13:41, 20 February 2023 (Alter: url. URLs might have been anonymized. Removed proxy/dead URL that duplicated identifier. Removed access-date with no URL. Removed parameters. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An elementary process in Zuse's Calculating Space: Two digital particles A and B form a new digital particle C.[1]

Calculating Space (Template:Lang-de) is Konrad Zuse's 1969 book on automata theory. He proposed that all processes in the universe are computational.[2] This view is known today as the simulation hypothesis, digital philosophy, digital physics or pancomputationalism.[3] Zuse proposed that the universe is being computed by some sort of cellular automaton or other discrete computing machinery,[2] challenging the long-held view that some physical laws are continuous by nature. He focused on cellular automata as a possible substrate of the computation, and pointed out that the classical notions of entropy and its growth do not make sense in deterministically computed universes. Zuse's thesis was later expanded by German computer scientist Jürgen Schmidhuber in his technical report Algorithmic Theories of Everything.[4]

See also

References

  1. ^ Zuse, Konrad (1967). "Rechnender Raum" (PDF). Elektronische Datenverarbeitung (in German). 8. Bad Hersfeld, Germany: 336–344. Archived (PDF) from the original on 2020-06-18. Retrieved 2022-08-02. (9 pages)
  2. ^ a b Mainzer, Klaus; Chua, Leon Ong (September 2011). The Universe as Automaton: From Simplicity and Symmetry to Complexity. Springer-Verlag. p. 6.
  3. ^ Müller, Vincent C. (January 2014). "Pancomputationalism: Theory or Metaphor?". In Hagengruber, Ruth; Riss, Uwe (eds.). Philosophy, Computing and Information Science. Pickering & Chattoo. pp. 213–221. Archived (PDF) from the original on 2021-10-21. Retrieved 2022-08-02.
  4. ^ Schmidhuber, Jürgen (2000-12-20). Algorithmic Theories of Everything. 2.0. Manno, Lugano, Switzerland. arXiv:quant-ph/0011122. Bibcode:2000quant.ph.11122S. Technical Report IDSIA-20-00.{{cite book}}: CS1 maint: location missing publisher (link) (50 pages)

Further reading