Time-travelling Turing Machines and the Self-consistent Halting Problem

José Ignacio Orlicki

doi:10.20944/preprints202405.2041.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 30 May 2024 / Approved: 30 May 2024 / Online: 30 May 2024 (13:39:03 CEST)

This paper introduces the novel concept of Time-Traveling Turing Machines (TTTMs) — Turing Machines with the ability to read symbols that have been explicitly sent from their future computational state. We delve into their properties and behavior, particularly emphasizing the importance of maintaining a self-consistent computational timeline. We present theorems demonstrating the universality of these machines and the challenges in achieving faster computations than traditional Turing Machines.

Turing machines; Time-travelling; Computability

Computer Science and Mathematics, Computer Science

Not displayed online.

Please leave your comment to this article below.

Mathematical equations can be typed in either LaTeX formats \\[ ... \\] or $$ ... $$, or MathML format <math> ... </math>. Try the LaTeX or MathML example.

Type equation:

Preview:

Copy equation into message below

Close menu

Please click a symbol to insert it into the message box below:

Please enter the link here:

Optionally, you can enter text that should appear as linked text:

Copy link into message below

Close menu

Please enter or paste the URL to the image here (please only use links to jpg/jpeg, png and gif images):

Copy image into message below

Close menu

Type author name or keywords to filter the list of references in this group (you can add a new citation under Bibliography):

No existing citations in Discussion Group

Wikify editor is a simple editor for wiki-style mark-up. It was written by MDPI for Sciforum in 2014. The rendering of the mark-up is based on Wiky.php with some tweaks. Rendering of mathematical equations is done with MathJax. Please send us a message for support or for reporting bugs.

Close menu

Please declare any conflicts of interest you may have with this paper, financial or otherwise.

I do not have a conflict of interest

I would like to declare a conflict of interest

Display my name on the website

Captcha

Renew

I accept the following conditions:

Comments must follow the standards of professional discourse and should focus on the scientific content of the article. Insulting or offensive language, personal attacks and off-topic remarks will not be permitted. Comments must be written in English. Preprints reserves the right to remove comments without notice. Readers who post comments are obliged to declare any competing interests, financial or otherwise.

* All users must log in before leaving a comment

Notify me about updates to this article or when a peer-reviewed version is published.

Time-travelling Turing Machines and the Self-consistent Halting Problem

Abstract

Keywords

Subject

Comments (0)