145
click to vote
MSCS
2010
15 years 1 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...