Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: Proof of Halting Problem Decidability in Typed Hypercomputational Programs (THP)
Date: Sat, 26 Apr 2025 11:03:06 +0300
Organization: -
Lines: 22
Message-ID: <vui3vq$1vidj$1@dont-email.me>
References: <E_QOP.4434$A71.1862@fx17.ams4>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 26 Apr 2025 10:03:09 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="c273896dee0e370dfae0ea3d66b22011";
	logging-data="2083251"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/mxCZeVNEhF/ax1NRzFpWT"
User-Agent: Unison/2.2
Cancel-Lock: sha1:zVoRrWIZt3zB3mTE7XhycHUsKDk=

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