Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The fastest way of computing all universes

From MaRDI portal
Publication:4907932
Jump to:navigation, search

DOI10.1142/9789814374309_0020zbMATH Open1256.03014OpenAlexW2274859272MaRDI QIDQ4907932FDOQ4907932

Jürgen Schmidhuber

Publication date: 26 February 2013

Published in: A Computable Universe (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814374309_0020




Recommendations

  • Debugging the universe
  • The universe as quantum computer
  • Computational universes
  • THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
  • The subjective computable universe


Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Physics (00A79) Cellular automata (computational aspects) (68Q80)







This page was built for publication: The fastest way of computing all universes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907932)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4907932&oldid=19298860"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 06:15. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki