Re: Proof of Halting Problem Decidability in Typed Hypercomputational Programs (THP)

On 2025-04-25 19:01:56 +0000, Mr Flibble said:

### Introduction
This document proves that the halting problem is decidable in a
computational framework called Typed Hypercomputational Programs (THP).
The THP model allows both halting and non-halting programs, uses a type
system to prevent self-referential paradoxes, and assumes infinite
computational resources (infinite time and memory) for simulating program
execution. The proof addresses the assumption that self-referential
conflation of a decider and its input constitutes a category (type) error,
which the type system eliminates to ensure decidability.
 ---
 ### Step 1: Define the THP Framework

Before the step 1 you should specify what it means to halt when infinitely
many elemntary actions are executed.
--
Mikko