First Page | Document Content | |
---|---|---|
Date: 2013-06-22 06:15:12 | 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 ListSource URL: www.ms.unimelb.edu.auDownload Document from Source WebsiteFile Size: 448,85 KBShare Document on Facebook |