Proving the number of steps you need to take on a number line where there are snakes 3 steps in front of you and a cliff 3 steps behind you where youre being tortured to come up with a set of instructions (step forward, step back) that works regardless of whether you execute every instruction, every other instruction, every 3rd instruction, every 4th instruction, and so on, up to 12 or some fixed number of instructions, takes a proof the size of Wikipedia (13 gigabytes).
Posted on: Thu, 06 Mar 2014 03:51:12 +0000
Trending Topics
Recently Viewed Topics
© 2015