Re: Growth Rate of Level-k Goodstein Function
- From: "Deedlit" <roycepeng@xxxxxxxxxxx>
- Date: 20 Oct 2006 20:26:07 -0700
r.e.s. wrote:
Hmm... I think for this to work, there has to be an increment on the
limit ordinals as well. I've seen the GW hierarchy with t+1 as the
exponent, but not in the fundamental sequence.
No limit ordinals are used in the above recursion for g_2, just
nonnegative integers -- the extended hierarchy isn't needed here.
(Your recursion for g_2 in terms of the F_a also doesn't involve
limit ordinals, although the Hardy hierarchy version does.)
Yes, of course, silly of me.
Incidentally, I thought about whether we could extend this to all g_k.
I thought
that perhaps we could use the Hardy hierarchy and index them by
Goodstein's
"majorant ordinals", but after some examination I don't think the
higher limit ordinals
will reduce to the same smaller ordinals - for example, take w^^(w+1).
For n = 2, n^^(n+1) = (n^^n)^n
For n = 3, n^^(n+1) = (n^^n)^[(n^^2)^(n*2 + 2)]
We would need to find an ordinal expression that matches up for all n,
and it doesn't
look like we can do that. So we can't match up the Goodstein function
with an
ordinal hierarchy like we did up to level 3.
.
- Follow-Ups:
- Re: Growth Rate of Level-k Goodstein Function
- From: r.e.s.
- Re: Growth Rate of Level-k Goodstein Function
- References:
- Re: Growth Rate of Level-k Goodstein Function
- From: Deedlit
- Re: Growth Rate of Level-k Goodstein Function
- From: r.e.s.
- Re: Growth Rate of Level-k Goodstein Function
- From: Deedlit
- Re: Growth Rate of Level-k Goodstein Function
- From: r.e.s.
- Re: Growth Rate of Level-k Goodstein Function
- Prev by Date: Re: computing on streams of data
- Next by Date: Re: Counter example for Mr. Diaby algorithm solving TSP problem in polynomial time
- Previous by thread: Re: Growth Rate of Level-k Goodstein Function
- Next by thread: Re: Growth Rate of Level-k Goodstein Function
- Index(es):
Relevant Pages
|