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 connectionsPath: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Lawrence D'Oliveiro Newsgroups: comp.theory Subject: Re: Cantor Diagonal Proof Date: Sat, 5 Apr 2025 02:19:19 -0000 (UTC) Organization: A noiseless patient Spider Lines: 11 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Sat, 05 Apr 2025 04:19:20 +0200 (CEST) Injection-Info: dont-email.me; posting-host="9f11b097b26f2656761f9579e269a581"; logging-data="1066489"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18va5udHRk1hLsSE/88VzDc" User-Agent: Pan/0.162 (Pokrosvk) Cancel-Lock: sha1:19uhSm8Sdf1NiVNOt9wDedgrQRM= On Sat, 5 Apr 2025 00:04:23 +0100, Richard Heathfield wrote: > Not all lists are random. I didn’t say they were. But if you like, it is possible to construct a list where the property of finding matches later in the list is guaranteed. In fact, such a list also provably leaves out whole swathes of known computable numbers. So you’d think the Cantor construction would have an easier time finding omissions, given that you know they exist on other grounds. But it doesn’t.