[text] THUS FOR ANY NONDETERMINISTIC TURING MACHINE M THAT RUNS IN SOME POLYNOMIAL TIME pm WE CAN DEVISE AN ALGORITHM THAT TAKES AN INPUT w OF LENGTH n AND PRODUCES Ep.. THE RUNNING TIME IS O0n ON A MULTITAPE DETERMINISTIC TURING MACHINE AND… WTF MAN. I JUST WANTED TO LEARN HOW TO PROGRAM VIDEO GAMES.
in Programming
Computer science isn’t what I expected
Programmer 803 Views
