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:
How long can a Turing machine program run when started on the blank tape before the tape becomes blank again? Of course, this will depend on the length of the program – how many states and colors it has. Even given these parameters, it is logically impossible to calculate how long a self-cleaning Turing machine can run. Any values that can be known have to be discovered empirically.
Maybe the Spaghetti Code Conjecture is False nickdrozd.github.io - get the latest breaking news, showbiz & celebrity photos, sport news & rumours, viral videos and top stories from nickdrozd.github.io Daily Mail and Mail on Sunday newspapers.