Re: Another proof: The Halting Problem Is Undecidable.

Liste des GroupesRevenir à theory 
Sujet : Re: Another proof: The Halting Problem Is Undecidable.
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theory
Date : 14. Oct 2024, 01:40:37
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <8bc20d66c9629cef21f75ad3be0a2b583c1c55f5.camel@gmail.com>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
On Sun, 2024-10-13 at 22:01 +0100, Ben Bacarisse wrote:
wij <wyniijj5@gmail.com> writes:
 
If 0.999..=1, you have to explain your arithmetic system.
 
Almost.  First you have to explain the notation.  That's easy (but
relatively advanced) as 0.999... denotes the limit of a sequence of
partial sums (sometimes called a series limit).  The arithmetic system
(the reals, where all such sums converge) comes after saying what the
... denotes.
 
When *you* say that 0.999... =/= 1 you always avoid saying what the
notation (specifically the ...) means in formal terms.
 

What I would say now is probably not different from
https://sourceforge.net/projects/cscall/files/MisFiles/RealNumber2-en.txt/download

"..." conventionally means "so on,..,etc.", likely infinitely. I use it like that.

As indicated in the above file:
"Theorem 5: The set of elements composed of finite discrete symbols and the set
         of elements composed of infinite discrete symbols cannot form 1-1
         correspond."

(did your formal system say that? I guess no)

That means whatever a formal system can do is limited. Almost everything
formally stated is impossible.

Take Archimedes' Axiom for example: It did not mention anything about infinity.
How can it *formally* deny the existence of infinity/infinitesimal? And, the
Archimedes' Axiom argument is likely suffering from circular reasoning as an
axiom. It needs to say what the R it is addressing. (The Axiom is new, it lacks
the source, and likely a 'popular' rumor to me if it is also 'formal'. E.g.
I just saw another one https://proofwiki.org/wiki/Axiom_of_Archimedes
∀x∈ℝ: ∃n∈ℕ, n>x
The problem is what exactly had Archimedes said? ).



Date Sujet#  Auteur
10 Oct 24 * Another proof: The Halting Problem Is Undecidable.13wij
10 Oct 24 +* Re: Another proof: The Halting Problem Is Undecidable.10wij
11 Oct 24 i`* Re: Another proof: The Halting Problem Is Undecidable.9Andy Walker
11 Oct 24 i `* Re: Another proof: The Halting Problem Is Undecidable.8wij
11 Oct 24 i  `* Re: Another proof: The Halting Problem Is Undecidable.7Andy Walker
12 Oct 24 i   `* Re: Another proof: The Halting Problem Is Undecidable.6wij
12 Oct 24 i    `* Re: Another proof: The Halting Problem Is Undecidable.5Andy Walker
13 Oct 24 i     `* Re: Another proof: The Halting Problem Is Undecidable.4wij
13 Oct 24 i      `* Re: Another proof: The Halting Problem Is Undecidable.3Ben Bacarisse
14 Oct 24 i       `* Re: Another proof: The Halting Problem Is Undecidable.2wij
14 Oct 24 i        `- Re: Another proof: The Halting Problem Is Undecidable.1Ben Bacarisse
11 Oct 24 `* Re: Another proof: The Halting Problem Is Undecidable.2Mikko
11 Oct 24  `- Re: Another proof: The Halting Problem Is Undecidable.1wij

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal