Cover Image

Approximate outputs of accelerated turing machines closest to their halting point

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

Full description

Saved in:
Bibliographic Details
Main Authors: Mambou, S., Krejcar, O., Selamat, A.
Format: Conference or Workshop Item
Published: 2019
Subjects:
T Technology (General)
Online Access:http://eprints.utm.my/id/eprint/88844/
http://www.dx.doi.org/10.1007/978-3-030-14799-0_60
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.88844
record_format eprints
spelling my.utm.888442020-12-29T04:38:22Z http://eprints.utm.my/id/eprint/88844/ Approximate outputs of accelerated turing machines closest to their halting point Mambou, S. Krejcar, O. Selamat, A. T Technology (General) 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. 2019 Conference or Workshop Item PeerReviewed Mambou, S. and Krejcar, O. and Selamat, A. (2019) Approximate outputs of accelerated turing machines closest to their halting point. In: 11th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2019, 8-11 Apr 2019, Yogyakarta, Indonesia. http://www.dx.doi.org/10.1007/978-3-030-14799-0_60
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic T Technology (General)
spellingShingle T Technology (General)
Mambou, S.
Krejcar, O.
Selamat, A.
Approximate outputs of accelerated turing machines closest to their halting point
description 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.
format Conference or Workshop Item
author Mambou, S.
Krejcar, O.
Selamat, A.
author_facet Mambou, S.
Krejcar, O.
Selamat, A.
author_sort Mambou, S.
title Approximate outputs of accelerated turing machines closest to their halting point
title_short Approximate outputs of accelerated turing machines closest to their halting point
title_full Approximate outputs of accelerated turing machines closest to their halting point
title_fullStr Approximate outputs of accelerated turing machines closest to their halting point
title_full_unstemmed Approximate outputs of accelerated turing machines closest to their halting point
title_sort approximate outputs of accelerated turing machines closest to their halting point
publishDate 2019
url http://eprints.utm.my/id/eprint/88844/
http://www.dx.doi.org/10.1007/978-3-030-14799-0_60
_version_ 1687393629935501312
score 13.211869

Similar Items