This is proven. It's known as the halting problem and is the central pillar of c...

		icepush 5 months ago \| parent \| context \| favorite \| on: Determination of the fifth Busy Beaver value This is proven. It's known as the halting problem and is the central pillar of computational complexity theory. The proof was invented by Alan Turing and is online.