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 <v54buj$lkkc$4@i2pn2.org>
Deutsch   English   Français   Italiano  
<v54buj$lkkc$4@i2pn2.org>

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

Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory,sci.logic
Subject: Re: H(D,D) cannot even be asked about the behavior of D(D) ---
 Boilerplate Reply
Date: Fri, 21 Jun 2024 13:06:27 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <v54buj$lkkc$4@i2pn2.org>
References: <v45tec$4q15$1@dont-email.me> <v4hfq9$2sdqr$5@dont-email.me>
 <v4hp3r$3viml$1@i2pn2.org> <v4hv85$3021v$1@dont-email.me>
 <v4ju8f$222a$1@i2pn2.org> <v4k1m4$3f99u$1@dont-email.me>
 <v4k4mt$3fnqu$1@dont-email.me> <v4maeo$3vv3f$1@dont-email.me>
 <v4mnim$1qt6$6@dont-email.me> <v4onga$hjo3$3@dont-email.me>
 <v4pbg4$ln46$1@dont-email.me> <v4rdtp$18al3$1@dont-email.me>
 <v4rvil$1boeu$2@dont-email.me> <v4s9hj$1dnm7$1@dont-email.me>
 <v4sa0h$1dk9i$3@dont-email.me> <v4sci6$1ebce$1@dont-email.me>
 <v4sd35$1eb2f$5@dont-email.me> <v4u3jl$1se49$1@dont-email.me>
 <v4umvh$1vpm0$7@dont-email.me> <v50d8k$2e51s$1@dont-email.me>
 <v50dtp$2e5ij$1@dont-email.me> <v51f4t$2k8ar$1@dont-email.me>
 <v51ge4$2kbbe$2@dont-email.me> <v52mil$jund$6@i2pn2.org>
 <v52n3h$2v5s6$1@dont-email.me> <v52p32$jund$7@i2pn2.org>
 <v52pht$2vh9u$1@dont-email.me> <v52qat$jund$9@i2pn2.org>
 <v52s4l$2vlma$1@dont-email.me> <v52td1$june$1@i2pn2.org>
 <v52tul$307ee$1@dont-email.me> <v5435h$lkkb$4@i2pn2.org>
 <v54bcf$38n2k$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 21 Jun 2024 17:06:27 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="709260"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <v54bcf$38n2k$1@dont-email.me>
Bytes: 4226
Lines: 56

On 6/21/24 12:56 PM, olcott wrote:
> On 6/21/2024 9:36 AM, Richard Damon wrote:
>> On 6/21/24 12:01 AM, olcott wrote:
> 
> 
> _DDD()
> [00002093] 55               push ebp
> [00002094] 8bec             mov ebp,esp
> [00002096] 6893200000       push 00002093 ; push DDD
> [0000209b] e853f4ffff       call 000014f3 ; call HH0
> [000020a0] 83c404           add esp,+04
> [000020a3] 5d               pop ebp
> [000020a4] c3               ret
> Size in bytes:(0018) [000020a4]
> 
>>>
>>> That is the only definitive way to determine the
>>> actual behavior that the finite string specifies.
>>>
>>
>> It is the only was to COMPUTE the actual behavior, but to DETERMINE it 
>> doesn't need that.
>>
> 
> Ah so you expect that HH0 must use its intuition to
> determine that behavior that it is supposed to report on.
> 


Nope, if it exists, it needs to compute the answer. But, it doesn't need 
to exist as a correct decider for halting.

That is part of your problem, you think that all problems need to be 
computable, but it is proven that they can not be by simple counting.

Thus, we KNOW that some problems that can be properly thought of as 
mappings are not computable, so, the fact that Halting is one of them is 
not a problem.

Remember, problems in Computation Theory are about CAN we build a 
machine to compute a given mapping, so forming a question about an 
uncomputable mapping isn't an "invalid" question, but just a question 
for which the computablity question is NO.

So, all your arguments about the Halting Question not being answerable 
by a computation are just proving the Halting Theorem, that the Halting 
Function is uncomputable, and not that the Halting Question is "Invalid" 
for some reason.

Every proper input (the representation of an actual Machine) has a 
correct answer, as defined by the behavior of the machine the input 
represents, but there just doesn't exist a machine that can compute the 
answer, and trying to redefine the criteria to be a computable one just 
shows that you don't understand that basic concept of the field.

Perhaps because it just breaks your fundamental (and wrong) idea that 
all Truth must be knowable/provable.