Refining Mark Burgin’s Case against the Church–Turing Thesis

Refining Mark Burgin’s Case against the Church–Turing Thesis

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 vis...

Full description

Saved in:
Bibliographic Details
Published in:Philosophies (Basel) Vol. 9; no. 4; p. 122
Main Author: Daylight, Edgar Graham
Format: Journal Article
Language:English
Published: Basel MDPI AG 01-08-2024
Subjects:
Batch processing
Church–Turing thesis
Computer science
inductive Turing machine
Mark Burgin
Mathematical problems
Power
RBM
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Daylight, Edgar Graham
Author_xml – sequence: 1
  givenname: Edgar Graham
  orcidid: 0000-0002-9815-3966
  surname: Daylight
  fullname: Daylight, Edgar Graham
BookMark eNptkE1OwzAQhS1UJErpCdhEYh1wbMdxdkDET6UiJFTWluOME5cSFztZsOsdWHG9noSUIsSC1RuN3nzz9I7RqHUtIHSa4HNKc3yxbuzKBTcIhBwznBBygMaE4TzOichGf-YjNA1hiTEmCcNpwsbo8gmMbW1bRw_Kv0TXva9tu918hqhQASJVK9uGLuoaiIqm97rZbj4Wvd8dLBoINpygQ6NWAaY_OkHPtzeL4j6eP97Niqt5rAmhXVxqKInJiCg5TTHXmmY4yY1JIWHCcEG1MUrQVGe8SlMhiOaYlBnjlQKuaE4naLbnVk4t5drbV-XfpVNWfi-cr6XyndUrkELzSpcs1TojDPJSYGCVTsFoA0qwamCd7Vlr7956CJ1cut63Q3xJcS4STiglg4vuXdq7EDyY368Jlrvm5T_N0y_5In2C
Cites_doi 10.1080/01445340.2017.1396520
10.7551/mitpress/11180.001.0001
10.1007/978-3-642-37225-4
10.3390/philosophies9010008
10.1080/01445340.2015.1082050
10.1007/978-3-642-56999-9
10.7551/mitpress/2030.001.0001
10.1145/2629499
10.1305/ndjfl/1093637647
10.1145/641205.641235
10.1016/j.tcs.2011.12.040
10.2178/bsl/1309952319
10.1145/384150.384166
10.1023/A:1021150928258
10.1016/0010-0277(86)90057-0
10.1007/s11023-011-9235-1
10.1305/ndjfl/1093883561
10.1016/j.tcs.2003.12.010
10.1145/3198448
10.1007/s11023-023-09634-0
10.3233/COM-180217
10.1007/s13347-014-0184-5
10.1145/1096000.1096001
ContentType Journal Article
Copyright 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
AABKS
ABSDQ
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.3390/philosophies9040122
DatabaseName CrossRef
Philosophy Collection
Philosophy Database
ProQuest Central (Alumni)
ProQuest Central
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central
Publicly Available Content Database
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Essentials
ProQuest Central Korea
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Academic
ProQuest Central China
Philosophy Database
Philosophy Collection
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: http://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
Computer Science
EISSN 2409-9287
ExternalDocumentID oai_doaj_org_article_8c6dcb45cc724e9b80e4dc5efcfea84d
10_3390_philosophies9040122
GroupedDBID AABKS
AADQD
AAFWJ
AAYXX
ABDBF
ABSDQ
ADBBV
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
CCPQU
CITATION
GROUPED_DOAJ
IAO
ITC
MODMG
M~E
OK1
PIMPY
ABUWG
AZQEC
DWQXO
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c223t-bceb2f728b63506cc37019ff5e148f683cffa835c76d55882c602b746dae6a393
IEDL.DBID DOA
ISSN 2409-9287
IngestDate Tue Oct 22 14:57:55 EDT 2024
Thu Oct 10 22:01:24 EDT 2024
Thu Sep 26 20:42:02 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c223t-bceb2f728b63506cc37019ff5e148f683cffa835c76d55882c602b746dae6a393
ORCID 0000-0002-9815-3966
OpenAccessLink https://doaj.org/article/8c6dcb45cc724e9b80e4dc5efcfea84d
PQID 3098162332
PQPubID 5046872
ParticipantIDs doaj_primary_oai_doaj_org_article_8c6dcb45cc724e9b80e4dc5efcfea84d
proquest_journals_3098162332
crossref_primary_10_3390_philosophies9040122
PublicationCentury 2000
PublicationDate 2024-08-01
PublicationDateYYYYMMDD 2024-08-01
PublicationDate_xml – month: 08
  year: 2024
  text: 2024-08-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Philosophies (Basel)
PublicationYear 2024
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References ref_14
Gherardi (ref_25) 2011; 17
Daylight (ref_32) 2024; 34
ref_35
ref_12
ref_34
Shapiro (ref_19) 1982; 23
Daylight (ref_21) 2015; 36
ref_33
ref_10
Hill (ref_28) 2016; 29
ref_30
Wiedermann (ref_24) 2012; 429
Copeland (ref_11) 2019; 62
Kugel (ref_15) 2002; 12
Wegner (ref_6) 2003; 46
Daylight (ref_20) 2014; 57
Kugel (ref_16) 2005; 48
Burgin (ref_18) 2015; 5
Kugel (ref_29) 1986; 22
ref_23
(ref_36) 2018; 39
MacLennan (ref_8) 2009; 5
Turing (ref_2) 1936; 42
McCarthy (ref_22) 1987; 28
ref_1
Burgin (ref_17) 1983; 270
(ref_9) 2011; 21
ref_3
Burgin (ref_13) 2001; 44
ref_27
ref_26
Daylight (ref_31) 2021; 10
Bringsjord (ref_7) 2004; 317
ref_5
ref_4
References_xml – volume: 39
  start-page: 140
  year: 2018
  ident: ref_36
  article-title: Kalmár’s Argument Against the Plausibility of Church’s Thesis
  publication-title: Hist. Philos. Log.
  doi: 10.1080/01445340.2017.1396520
– ident: ref_10
  doi: 10.7551/mitpress/11180.001.0001
– ident: ref_30
– ident: ref_35
  doi: 10.1007/978-3-642-37225-4
– ident: ref_26
  doi: 10.3390/philosophies9010008
– ident: ref_34
– volume: 36
  start-page: 205
  year: 2015
  ident: ref_21
  article-title: Towards a Historical Notion of ‘Turing—The Father of Computer Science’
  publication-title: Hist. Philos. Log.
  doi: 10.1080/01445340.2015.1082050
  contributor:
    fullname: Daylight
– ident: ref_3
  doi: 10.1007/978-3-642-56999-9
– ident: ref_5
  doi: 10.7551/mitpress/2030.001.0001
– volume: 57
  start-page: 36
  year: 2014
  ident: ref_20
  article-title: A Turing Tale
  publication-title: Commun. ACM
  doi: 10.1145/2629499
  contributor:
    fullname: Daylight
– ident: ref_14
– volume: 28
  start-page: 520
  year: 1987
  ident: ref_22
  article-title: Turing Projectability
  publication-title: Notre Dame J. Form. Log.
  doi: 10.1305/ndjfl/1093637647
  contributor:
    fullname: McCarthy
– ident: ref_1
– volume: 46
  start-page: 100
  year: 2003
  ident: ref_6
  article-title: Computation beyond Turing machines
  publication-title: Commun. ACM
  doi: 10.1145/641205.641235
  contributor:
    fullname: Wegner
– ident: ref_23
– volume: 429
  start-page: 202
  year: 2012
  ident: ref_24
  article-title: Computation as an unbounded process
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2011.12.040
  contributor:
    fullname: Wiedermann
– volume: 5
  start-page: 369
  year: 2009
  ident: ref_8
  article-title: Super-Turing or non-Turing? Extending the concept of computation
  publication-title: Int. J. Unconv. Comput.
  contributor:
    fullname: MacLennan
– volume: 17
  start-page: 394
  year: 2011
  ident: ref_25
  article-title: Alan Turing and the Foundations of Computable Analysis
  publication-title: Bull. Symb. Log.
  doi: 10.2178/bsl/1309952319
  contributor:
    fullname: Gherardi
– volume: 42
  start-page: 230
  year: 1936
  ident: ref_2
  article-title: On Computable Numbers, with an Application to the Entscheidungsproblem
  publication-title: Proc. Lond. Math. Soc.
  contributor:
    fullname: Turing
– volume: 44
  start-page: 83
  year: 2001
  ident: ref_13
  article-title: How We Know What Technology Can Do
  publication-title: Commun. ACM
  doi: 10.1145/384150.384166
  contributor:
    fullname: Burgin
– volume: 270
  start-page: 1289
  year: 1983
  ident: ref_17
  article-title: Inductive Turing Machines
  publication-title: Not. Acad. Sci. USSR
  contributor:
    fullname: Burgin
– volume: 12
  start-page: 563
  year: 2002
  ident: ref_15
  article-title: Computing Machines Can’t Be Intelligent (...and Turing Said So)
  publication-title: Minds Mach.
  doi: 10.1023/A:1021150928258
  contributor:
    fullname: Kugel
– volume: 22
  start-page: 137
  year: 1986
  ident: ref_29
  article-title: Thinking may be more than computing
  publication-title: Cognition
  doi: 10.1016/0010-0277(86)90057-0
  contributor:
    fullname: Kugel
– ident: ref_4
– ident: ref_33
– ident: ref_27
– volume: 21
  start-page: 301
  year: 2011
  ident: ref_9
  article-title: Significance of models of computation, from Turing model to natural computation
  publication-title: Minds Mach.
  doi: 10.1007/s11023-011-9235-1
– ident: ref_12
– volume: 23
  start-page: 14
  year: 1982
  ident: ref_19
  article-title: Acceptable notation
  publication-title: Notre Dame J. Form. Log.
  doi: 10.1305/ndjfl/1093883561
  contributor:
    fullname: Shapiro
– volume: 317
  start-page: 167
  year: 2004
  ident: ref_7
  article-title: The modal argument for hypercomputing minds
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2003.12.010
  contributor:
    fullname: Bringsjord
– volume: 62
  start-page: 66
  year: 2019
  ident: ref_11
  article-title: The Church-Turing thesis: Logical limit or breachable barrier?
  publication-title: Commun. ACM
  doi: 10.1145/3198448
  contributor:
    fullname: Copeland
– volume: 34
  start-page: 29
  year: 2024
  ident: ref_32
  article-title: True Turing: A Bird’s-Eye View
  publication-title: Minds Mach.
  doi: 10.1007/s11023-023-09634-0
  contributor:
    fullname: Daylight
– volume: 10
  start-page: 141
  year: 2021
  ident: ref_31
  article-title: The Halting Problem and Security’s Language-Theoretic Approach: Praise and Criticism from a Technical Historian
  publication-title: Computability
  doi: 10.3233/COM-180217
  contributor:
    fullname: Daylight
– volume: 5
  start-page: 71
  year: 2015
  ident: ref_18
  article-title: Properties of Stabilizing Computations
  publication-title: Theory Appl. Math. Comput. Sci.
  contributor:
    fullname: Burgin
– volume: 29
  start-page: 35
  year: 2016
  ident: ref_28
  article-title: What an Algorithm Is
  publication-title: Philos. Technol.
  doi: 10.1007/s13347-014-0184-5
  contributor:
    fullname: Hill
– volume: 48
  start-page: 33
  year: 2005
  ident: ref_16
  article-title: It’s Time to Think Outside The Computational Box
  publication-title: Commun. ACM
  doi: 10.1145/1096000.1096001
  contributor:
    fullname: Kugel
SSID ssj0002140514
Score 2.3152466
Snippet 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...
SourceID doaj
proquest
crossref
SourceType Open Website
Aggregation Database
StartPage 122
SubjectTerms Batch processing
Church–Turing thesis
Computer science
inductive Turing machine
Mark Burgin
Mathematical problems
Power
RBM
Title Refining Mark Burgin’s Case against the Church–Turing Thesis
URI https://www.proquest.com/docview/3098162332
https://doaj.org/article/8c6dcb45cc724e9b80e4dc5efcfea84d
Volume 9
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LSsNAFB20KzdifWC1yixcKBiazGQe2WlrS1cutIK7MM_STS1Nu-8_uPL3-iXeSdKiKLhxGwIJ577OgZlzEbryCXEwx0ykmKRRKhiLpLQ6sloboWGAqDRcFB4-i8dX-dAPNjnbVV_hTFhlD1wB15GGW6NTZowgqcu0jF1qDXPeeKdkasvuG8svYir0YAK6AahAZTNEQdd3ZpvNACBAM8jchJBvo6h07P_RkMspMzhA-zU9xPfVbzXRjpseomZdgAW-rl2ib47Q3ZPz5XIHHK7b4O5yPp5M16uPAvdgMGE1BslfLDDwO1xtfFqv3kflnUQMqVFMimP0MuiPesOoXocQGZjhi0gbUMFeEKkB3JgbQ4OVuvfMgaTxXFLjvQJCZQS3jAFzNjwmWqTcKscVzegJakzfpu4UYQYighMiNFVxqgngqL1KqCc2tlA2qoVuN8jks8r1Ige1EIDMfwGyhboBve2rwbK6fACBzOtA5n8FsoXaG-zzuo6KnMaZTIChUXL2H984R3sESEl1gK-NGov50l2g3cIuL8v8-QSQjs_Y
link.rule.ids 315,782,786,866,2108,27935,27936
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Refining+Mark+Burgin%E2%80%99s+Case+against+the+Church%E2%80%93Turing+Thesis&rft.jtitle=Philosophies+%28Basel%29&rft.au=Edgar+Graham+Daylight&rft.date=2024-08-01&rft.pub=MDPI+AG&rft.eissn=2409-9287&rft.volume=9&rft.issue=4&rft.spage=122&rft_id=info:doi/10.3390%2Fphilosophies9040122&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2409-9287&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2409-9287&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2409-9287&client=summon