{"title":"Refining Mark Burgin’s Case against the Church–Turing Thesis","authors":"Edgar Graham Daylight","doi":"10.3390/philosophies9040122","DOIUrl":null,"url":null,"abstract":"The outputs of a Turing machine are not revealed for inputs on which the machine fails to halt. Why is an observer not allowed to see the generated output symbols as the machine operates? Building on the pioneering work of Mark Burgin, we introduce an extension of the Turing machine model with a visible output tape. As a subtle refinement to Burgin’s theory, we stipulate that the outputted symbols cannot be overwritten: at step i, the content of the output tape is a prefix of the content at step j, where i<j. Our Refined Burgin Machines (RBMs) compute more functions than Turing machines, but fewer than Burgin’s simple inductive Turing machines. We argue that RBMs more closely align with both human and electronic computers than Turing machines do. Consequently, RBMs challenge the dominance of Turing machines in computer science and beyond.","PeriodicalId":31446,"journal":{"name":"Philosophies","volume":"35 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Philosophies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/philosophies9040122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"HISTORY & PHILOSOPHY OF SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The outputs of a Turing machine are not revealed for inputs on which the machine fails to halt. Why is an observer not allowed to see the generated output symbols as the machine operates? Building on the pioneering work of Mark Burgin, we introduce an extension of the Turing machine model with a visible output tape. As a subtle refinement to Burgin’s theory, we stipulate that the outputted symbols cannot be overwritten: at step i, the content of the output tape is a prefix of the content at step j, where i
对于机器无法停止的输入,图灵机的输出不会显示。为什么观察者不能看到机器运行时生成的输出符号呢?在马克-伯金(Mark Burgin)的开创性工作基础上,我们引入了图灵机模型的扩展,即可见输出带。作为对伯金理论的微妙改进,我们规定输出符号不能被覆盖:在第 i 步,输出带的内容是第 j 步内容的前缀,其中 i