‘Runtime distribution plot showing all the 10 000 Turing machines in (2; 2) compressed in a Peano curve packing array’, figure 3 from “Computer Runtimes and the Length of Proofs” by Hector Zenil (2012). “Each point…represents a Turing machine and…the lighter the square the sooner it halted. White cells represent machines that don’t halt. Red cells…show the Busy Beaver machines.”

via crystilogic

### Like this:

Like Loading...

*Related*

Tags: art, Hector Zenil, mathematics

This entry was posted on May 25, 2012 at 3:20 pm and is filed under Uncategorized. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

## Leave a Reply