Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Keith Thompson <Keith.S.Thompson+u@gmail.com>
Newsgroups: comp.theory
Subject: Re: Cantor Diagonal Proof
Date: Mon, 07 Apr 2025 14:24:23 -0700
Organization: None to speak of
Lines: 24
Message-ID: <875xjfd5rs.fsf@nosuchdomain.example.com>
References: <vsn1fu$1p67k$1@dont-email.me>
	<gGKdnZiYPJVC03L6nZ2dnZfqn_udnZ2d@brightview.co.uk>
	<vsnk2v$2fc5a$1@dont-email.me> <vsnmtg$2i4qp$3@dont-email.me>
	<vsno7m$2g4cd$3@dont-email.me> <vsnp0o$2ka6o$2@dont-email.me>
	<vsnpv4$2g4cd$6@dont-email.me> <vsntes$2osdn$1@dont-email.me>
	<vsntv3$2paf9$1@dont-email.me> <vso1a0$2sf7o$1@dont-email.me>
	<vso2ff$2tj1d$2@dont-email.me> <vso3rj$2vems$2@dont-email.me>
	<vso4gh$2vg3b$1@dont-email.me> <vsqmlb$1ktm5$6@dont-email.me>
	<vsr1ae$1pr17$2@dont-email.me> <vst4nm$8daf$2@dont-email.me>
	<vst8ci$aeqh$3@dont-email.me> <vsutjt$21mp2$2@dont-email.me>
	<vsuvp1$227l5$1@dont-email.me> <vsvv3h$36pju$2@dont-email.me>
	<vt01u5$38f07$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 07 Apr 2025 23:24:24 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="2714e7df686d80d73a1feebaa5e76a7a";
	logging-data="687569"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18TLDttoGqH4ngVrapmNmY6"
User-Agent: Gnus/5.13 (Gnus v5.13)
Cancel-Lock: sha1:31dmk61u1X3/eiEDPQEXW8VAwGo=
	sha1:jWPObuopFC++qT47AF7n7kpkj1E=
Bytes: 2462

Richard Heathfield <rjh@cpax.org.uk> writes:
> On 07/04/2025 08:33, Lawrence D'Oliveiro wrote:
[...]
>> That’s not what “incomputable” means.
>
> Yeah, it is. We've already had this argument. Turing won:  "The
> "computable" numbers may be described briefly as the real numbers
> whose expressions as a decimal are calculable by finite means."
[...]

That's a little too briefly.

Quoting Wikipedia:

    In mathematics, computable numbers are the real numbers that can be
    computed to within any desired precision by a finite, terminating
    algorithm.

By dropping the "to within any desired precision", your description
implies (unintentionally, I'm sure) that pi is not computable.

-- 
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */