comparemela.com
Home
Live Updates
A Formal Theory of Spaghetti Code : comparemela.com
A Formal Theory of Spaghetti Code : comparemela.com
A Formal Theory of Spaghetti Code
The Spaghetti Code Conjecture (SCC) says that Busy Beaver programs – the longest-running Turing machine programs of a given length – ought to be as complicated as possible. This was first proposed by Scott Aaronson:
Related Keywords
Terry Ligocki ,
Pascal Michel ,
Boyd Johnson ,
Scott Aaronson ,
Shawn Ligocki ,
,
Spaghetti Code Conjecture ,
Busy Beaver ,
Busy Beavers ,
Beeping Busy Beaver ,
N Statek Color ,
Clean Code Conjecture ,