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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2019
|
| Subjects: | |
| 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!
|