{"title":"Turing machines to word problems","authors":"Charles F. Miller","doi":"10.1017/CBO9781107338579.010","DOIUrl":null,"url":null,"abstract":"We trace the emergence of unsolvable problems in algebra and topology from the unsolvable halting problem for Turing machines. §","PeriodicalId":139105,"journal":{"name":"Turing's Legacy","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Turing's Legacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/CBO9781107338579.010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
We trace the emergence of unsolvable problems in algebra and topology from the unsolvable halting problem for Turing machines. §