Liste des Groupes | Revenir à theory |
On 6/7/2024 6:18 PM, Richard Damon wrote:It isn't actually PROVING anything!!!On 6/7/24 7:07 PM, olcott wrote:That makes perfect sense.On 6/7/2024 6:00 PM, Richard Damon wrote:>On 6/7/24 6:35 PM, olcott wrote:>On 6/7/2024 5:22 PM, joes wrote:>Am Fri, 07 Jun 2024 17:11:00 -0500 schrieb olcott:>That it is literally impossible to prove that the following is falseIf you consider it unfalsifiable, why do you care?
conclusively proves that it is true and the proof really need not be
wrapped in any tuxedo.
>
The entire body of truth is unfalsifiable.
https://en.wikipedia.org/wiki/Falsifiability
>
That "cats" <are> "animals" is unfalsifiable because
it is inherently true.
>
You are conflating empirical with analytical truth.
Scientific principles do not exactly apply to math.
>>We can get on to other key points only after we have closure on thisWhat do you need closure for? You only want agreement.
{foundation of simulating halt deciders} point.
>
I must get closure on each of the four points of
my proof so that I know that my words can possibly
be understood. Without this publication is hopeless.
>
Except that you don't have a "Proof" because it isn't in the form of a formal proof.
>
All you have is an arguement.
A proof need not be dressed in any tuxedo. As long as correct
rebuttal has been shown to be categorically impossible then
the point has been fully proven.
>
It may not need a "tuxedo", but it needs to start with a clear mention of the accepted truths it is starting from, and then clearly state the acceptable operations being done with them to get to the conclusion.
>
So what exactly is missing from this?
Try to show how this DD correctly simulated by any HH ever
stops running without having its simulation aborted by HH.
_DD()
[00001e12] 55 push ebp
[00001e13] 8bec mov ebp,esp
[00001e15] 51 push ecx
[00001e16] 8b4508 mov eax,[ebp+08]
[00001e19] 50 push eax ; push DD
[00001e1a] 8b4d08 mov ecx,[ebp+08]
[00001e1d] 51 push ecx ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH
A {correct simulation} means that each instruction of the
above x86 machine language of DD is correctly simulated
by HH and simulated in the correct order.
*The definition of the x86 programming language is assumed*
https://c9x.me/x86/
https://www.cs.virginia.edu/~evans/cs216/guides/x86.html
Les messages affichés proviennent d'usenet.