PhilSci Archive

Arithmetic logical Irreversibility and the Turing's Halt Problem

Lapin, Yair (2021) Arithmetic logical Irreversibility and the Turing's Halt Problem. [Preprint]

This is the latest version of this item.

[img] Text
irrebersibility.pdf

Download (477kB)

Abstract

A new approach to the halting problem of the Turing machine using different interpretations of the Shannon measure of the information on the computational process represented as a distribution of events (deleting, logical or arithmetic operations) and defining a new concept of arithmetic logical irreversibility and memory erasure that generate uncertainty and computational improbability due to loss of information during these events. Different computational steps (input) may give the same result (next step, output) introducing thus information entropy in the computing process and uncertainty about the original step (cause). This means that the same output may be produced by different inputs. Global indeterminism of computation as distribution but determinism of the computation as current process because the outputs are the same but the information not. The program or Turing machine as macro description of the computational states as micro description that they may be several and different but give the same result when they work .


Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Preprint
Creators:
CreatorsEmailORCID
Lapin, YairYair.Lapin@mail.huji.ac.il0000-0003-3233-3603
Keywords: Turing Halt problem, Gödel Theorem , Information Theory , Algorithmic information theory, Decision problem
Subjects: Specific Sciences > Mathematics > Logic
Specific Sciences > Computer Science
Specific Sciences > Mathematics
Depositing User: mr Yair Lapin
Date Deposited: 12 Apr 2022 16:19
Last Modified: 12 Apr 2022 16:19
Item ID: 20447
Official URL: https://www.academia.edu/49009877/Arithmetic_logic...
Subjects: Specific Sciences > Mathematics > Logic
Specific Sciences > Computer Science
Specific Sciences > Mathematics
Date: 1 May 2021
URI: http://philsci-archive.pitt.edu/id/eprint/20447

Available Versions of this Item

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item