About the work
This image was generated in the course of an investigation of the distribution of runtimes of programs in relation to the lengths of mathematical proofs, the results of which are being published in my paper bearing the title “Computer Runtimes and the Length of Proofs with an Algorithmic Probabilistic Application to Optimal Waiting Times in [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1wGOVNZsQ:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1
Print work information
Work information
Title Visualizing the Computational Universe or Turing’s Deep Field
This image was generated in the course of an investigation of the distribution of runtimes of programs in relation to the lengths of mathematical proofs, the results of which are being published in my paper bearing the title “Computer Runtimes and the Length of Proofs with an Algorithmic Probabilistic Application to Optimal Waiting Times in [...]
<http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1wGOVNZsQ:yIl2AUoC8zA><http://feeds.feedburner.com/~ff/AnimaExMachina?a=F7MEZ1RcIUw:T-1
Work type Article
Tags halting times, mathematical logic, foundations of math, busy beaver, universality and unsolvability, halting problem, turing machines, automatic theorem proving, computability, foundations of computation, computer runtimes, complexity, computer science, length of proofs
-------------------------
Registry info in Safe Creative
Identifier 1201050851942
Entry date Jan 5, 2012, 6:45 AM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Jan 5, 2012.
Information available at https://www.safecreative.org/work/1201050851942-visualizing-the-computational-universe-or-turing-s-deep-field
/
Registration: 1201050851942
