Refining Mark Burgin's Case against the Church-Turing Thesis

被引:0
|
作者
Daylight, Edgar Graham [1 ]
机构
[1] Dept Comp Sci, Celestijnenlaan 200a,Box 2402, B-3001 Leuven, Belgium
关键词
inductive Turing machine; Mark Burgin; Church-Turing thesis; RBM; MACHINES;
D O I
10.3390/philosophies9040122
中图分类号
N09 [自然科学史]; B [哲学、宗教];
学科分类号
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要
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.
引用
收藏
页数:18
相关论文
共 50 条
  • [31] The Church-Turing thesis: Still valid after all these years?
    Galton, Antony
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 178 (01) : 93 - 102
  • [32] THE PARADIGMS AND PARADOXES OF INTELLIGENCE .2. THE CHURCH-TURING THESIS
    KURZWEIL, R
    LIBRARY JOURNAL, 1992, 117 (13) : 73 - 74
  • [33] Where Does AlphaGo Go: From Church-Turing Thesis to AlphaGo Thesis and Beyond
    Wang, Fei-Yue
    Zhang, Jun Jason
    Zheng, Xinhu
    Wang, Xiao
    Yuan, Yong
    Dai, Xiaoxiao
    Zhang, Jie
    Yang, Liuqing
    IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2016, 3 (02) : 113 - 120
  • [34] Where does AlphaGo go: From church-turing thesis to AlphaGo thesis and beyond
    Wang F.-Y.
    Zhang J.J.
    Zheng X.
    Wang X.
    Yuan Y.
    Dai X.
    Zhang J.
    Yang L.
    2016, Institute of Electrical and Electronics Engineers Inc. (03) : 113 - 120
  • [35] From the church-turing thesis to the first-order algorithm theorem
    Kripke, SA
    15TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2000, : 177 - 177
  • [36] Where Does AlphaGo Go: From Church-Turing Thesis to AlphaGo Thesis and Beyond
    Fei-Yue Wang
    Jun Jason Zhang
    Xinhu Zheng
    Xiao Wang
    Yong Yuan
    Xiaoxiao Dai
    Jie Zhang
    Liuqing Yang
    IEEE/CAAJournalofAutomaticaSinica, 2016, 3 (02) : 113 - 120
  • [37] Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems
    Braverman, Mark
    Schneider, Jonathan
    Rojas, Cristobal
    PHYSICAL REVIEW LETTERS, 2015, 115 (09)
  • [38] How to Make a Meaningful Comparison of Models: The Church-Turing Thesis Over the Reals
    Pegny, Mael
    MINDS AND MACHINES, 2016, 26 (04) : 359 - 388
  • [39] The physical Church-Turing thesis and non-deterministic computation over the real numbers
    Dowek, Gilles
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2012, 370 (1971): : 3349 - 3358
  • [40] Kripke’s paradox and the Church–Turing thesis
    Mark D. Sprevak
    Synthese, 2008, 160 : 285 - 295