Forgot your password?
typodupeerror

Comment applying computability theory (Score 1) 198

UTM is an unsolvable problem. We should keep in mind that since a UTM requires infinitly long tape there does not exits a mechanical implementation, since all our representations of storage are by nature finite. However, we can take memeory to be infinite, (i.e. when we need more space on the tape, we add more memory sticks) thus making a general computer theoretically able to simulate a UTM. Interesting project nonetheless.

Slashdot Top Deals

"Here at the Phone Company, we serve all kinds of people; from Presidents and Kings to the scum of the earth ..."

Working...