Deutsch English Français Italiano |
<v4jao4$3b7mr$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!feed.opticnetworks.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: sci.math Subject: Re: how Date: Fri, 14 Jun 2024 23:01:39 -0700 Organization: A noiseless patient Spider Lines: 32 Message-ID: <v4jao4$3b7mr$1@dont-email.me> References: <qHqKnNhkFFpow5Tl3Eiz12-8JEI@jntp> <v0c3n7$2538n$3@i2pn2.org> <V2ROVHVyNn8DKH24DsjVtR7I5C0@jntp> <v0f20n$28f0q$1@i2pn2.org> <UM7wKwXAIk3SfQ0MR8yg-U-xiMw@jntp> <v0geub$2a19r$3@i2pn2.org> <bbeK5eCmOQ6N-LVr1uyjOk8Yyng@jntp> <v0gqsr$2a19s$4@i2pn2.org> <ZqDu6OJ6PIxaTyzn9byQvORrwfY@jntp> <v0jciu$2djof$1@i2pn2.org> <_yFJcrVH3mCQISnbXb4RkUGQ63Q@jntp> <v10h76$3vdul$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 15 Jun 2024 08:01:41 +0200 (CEST) Injection-Info: dont-email.me; posting-host="a764365b2fbf824c5902411804e10ffa"; logging-data="3514075"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+6FhOm1V+3Ey1m2fvjFglBYNJ8sgu9rIs=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:9MNx+Mw6lj+9cfYi0TByUKnlmEc= Content-Language: en-US In-Reply-To: <v10h76$3vdul$1@dont-email.me> Bytes: 1972 On 5/2/2024 10:06 AM, Moebius wrote: > Am 30.04.2024 um 14:56 schrieb WM: > >> The end is smaller than ω. > > The sequence of natural numbers (all of which are smaller than ω) does > not have an end, Du Depp! > Fwiw, here how I generally write my recursive functions. Say the natural numbers, including zero here: r[0] = 0 r[n + 1] = r[n] + 1 Lets expand that for a couple of iterations: r[0] = 0 r[1] = r[0] + 1 = 1 r[2] = r[1] + 1 = 2 r[3] = r[2] + 1 = 3 .... [n] where n is an index vs: r_0 = 0 r_(n+1) = r_n + 1 Both seem okay to me, as in I can understand both of them.