Article <v1u5so$3nqc3$2@dont-email.me>

Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <v1u5so$3nqc3$2@dont-email.me>

Deutsch English Français Italiano

<v1u5so$3nqc3$2@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory,sci.logic
Subject: Re: A computable function that reports on the behavior of its actual
 self is not allowed
Date: Mon, 13 May 2024 17:57:28 -0500
Organization: A noiseless patient Spider
Lines: 40
Message-ID: <v1u5so$3nqc3$2@dont-email.me>
References: <v1r566$2uo21$1@dont-email.me> <v1smrp$3clsp$1@dont-email.me>
 <v1t563$3g3o3$2@dont-email.me> <v1u201$3mvsa$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 14 May 2024 00:57:28 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="d3c8e0ce04b0d93bf756b16462dda1b4";
	logging-data="3926403"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX196iaNsOOSaM68amYJDEeX4"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:Tvx4pYL152B5u7XXEuhhNXJHk7E=
In-Reply-To: <v1u201$3mvsa$2@dont-email.me>
Content-Language: en-US
Bytes: 2837

On 5/13/2024 4:50 PM, immibis wrote:
> On 13/05/24 15:39, olcott wrote:
>> On 5/13/2024 4:34 AM, Fred. Zwarts wrote:
>>> Op 12.mei.2024 om 21:27 schreef olcott:
>>>> Computable functions are the basic objects of study in computability
>>>> theory. Computable functions are the formalized analogue of the
>>>> intuitive notion of algorithms, in the sense that a function is
>>>> computable if there exists an algorithm that can do the job of the
>>>> function, i.e. given an input of the function domain it can return the
>>>> corresponding output. https://en.wikipedia.org/wiki/Computable_function
>>>>
>>>> A computable function that reports on the behavior of its actual
>>>> self (or reports on the behavior of its caller) is not allowed.
>>>
>>> So, olcott uses his authority to create a new problem. Why would 
>>> anybody be interested in such limitation?
>>>
>>
>> The definition of computable function is an axiomatic basis
>> not any mere authority.
>>
> There's no axiom that says computable functions aren't allowed to have 
> themselves as input. 

If you are 100% precise with the meaning of your words you
already know that no executed embedded_H can possibly report
on its own behavior because no TM can take another TM as input.

If you are very sloppy here you will think that an executing
Turing Machine is exactly the same thing as a finite string
Turing machine description.

Rebuttals that are sloppy with the meaning of words allow
incorrect rebuttals to seem plausible to people that are
hardly paying attention.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer