‘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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s