Approximate Outputs of Accelerated Turing Machines Closest to Their Halting Point

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F19%3A50015943" target="_blank" >RIV/62690094:18450/19:50015943 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-030-14799-0_60" target="_blank" >http://dx.doi.org/10.1007/978-3-030-14799-0_60</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-14799-0_60" target="_blank" >10.1007/978-3-030-14799-0_60</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Approximate Outputs of Accelerated Turing Machines Closest to Their Halting Point

Popis výsledku v původním jazyce

The accelerated Turing machine (ATM) which can compute super-tasks are devices with the same computational structure as Turing machines (TM) and they are also defined as the work-horse of hypercomputation. Is the final output of the ATM can be produced at the halting state? We supported our analysis by reasoning on Thomson’s paradox and by looking closely the result of the Twin Prime conjecture. We make sure to avoid unnecessary discussion on the infinite amount of space used by the machine or considering Thomson’s lamp machine, on the difficulty of specifying a machine’s outcome. Furthermore, it’s important for us that a clear definition counterpart for ATMs of the non-halting/halting dichotomy for classical Turing must be introduced. Considering a machine which has run for a countably infinite number of steps, this paper addresses the issue of defining the output of a machine close or at the halting point.

Název v anglickém jazyce

Approximate Outputs of Accelerated Turing Machines Closest to Their Halting Point

Popis výsledku anglicky

The accelerated Turing machine (ATM) which can compute super-tasks are devices with the same computational structure as Turing machines (TM) and they are also defined as the work-horse of hypercomputation. Is the final output of the ATM can be produced at the halting state? We supported our analysis by reasoning on Thomson’s paradox and by looking closely the result of the Twin Prime conjecture. We make sure to avoid unnecessary discussion on the infinite amount of space used by the machine or considering Thomson’s lamp machine, on the difficulty of specifying a machine’s outcome. Furthermore, it’s important for us that a clear definition counterpart for ATMs of the non-halting/halting dichotomy for classical Turing must be introduced. Considering a machine which has run for a countably infinite number of steps, this paper addresses the issue of defining the output of a machine close or at the halting point.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISBN

978-3-030-14798-3

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

12

Strana od-do

702-713

Název nakladatele

Springer Verlag

Místo vydání

Berlin

Místo konání akce

Yogakarta

Datum konání akce

8. 10. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—