Re: Another proof: The Halting Problem Is Undecidable.

Liste des GroupesRevenir à theory 
Sujet : Re: Another proof: The Halting Problem Is Undecidable.
De : ben (at) *nospam* bsb.me.uk (Ben Bacarisse)
Groupes : comp.theory
Date : 13. Oct 2024, 22:01:02
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87v7xvd8fl.fsf@bsb.me.uk>
References : 1 2 3 4 5 6 7 8
User-Agent : Gnus/5.13 (Gnus v5.13)
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.

--
Ben.

Date Sujet#  Auteur
5 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal