Back to Results
First PageMeta Content



TURING MACHINES TO WORD PROBLEMS CHARLES F. MILLER III Abstract. We trace the emergence of unsolvable problems in algebra and topology from the unsolvable halting problem for Turing machines.
Add to Reading List

Document Date: 2013-06-22 06:15:12


Open Document

File Size: 448,85 KB

Share Result on Facebook