• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Tetration and higher-order operations on transfinite ordinals quickfur Junior Fellow Posts: 22 Threads: 1 Joined: Feb 2008 08/16/2008, 01:58 AM Just a quick update on this subject... the ETF function I defined deals only with binary trees. This corresponds with the Veblen hierarchy, which is generated by the binary Veblen function phi_a(b). Oswald Veblen himself actually went further than this, to define ordinal functions of n variables. These correspond with functions on n-ary trees; it is possible to define an n-ary tree transformation function along similar lines as I have, that reduces a left-branching tree to a very, very long right-branching one. Now if we take the limit of this process (since there is no end to the ordinals), we have a function that deals trees with omega children. (Some care has to be taken here, to ensure that repeated applications of the function will terminate: this can be assured by substituting a finite, but varying, value for omega---in effect, we're dealing with trees where the number of children is indexed.) This brings us up to something called the "small Veblen ordinal". But Veblen went further: now that we've reached omega, the next logical step is to create a function with omega+1 arguments (or equivalently, a tree with omega+1 children per node). Then omega+2, omega+3, ... and so forth. Eventually, we may just define a function that takes an ordinal number of arguments. Once we get to this point, we might as well take the output of our functions, which is an ordinal, and use that as the number of arguments to our next-higher function, and so forth. Somewhere along the line, we get to the point where the ordinals generated are so large, that to get any farther, we will need a function with X number of arguments, where X is an ordinal larger than any we have generated so far. The smallest such X is called the "large Veblen ordinal", and represents the limit of what is attainable using ordinal functions---or, equivalently, it represents the limit of computable functions that can be reached by iteration and diagonalization. In other words, it is iteration and diagonalization taken to the logical conclusion. (As a side note, Jonathan Bowers' Exploding Array Function has the potential to span the ordinals below X. A very impressive feat for someone with not much formal training!) Iteration and diagonalization will never reach X, so the function that corresponds with X represents the fastest-growing function that can be constructed from the successor function via iteration and diagonalization. The kicker is that X lies below the Church-Kleene ordinal. So not only is it computable, it barely scratches the surface of fast-growing computable functions! To get beyond X, we will truly need unconstrained recursion, of the kind that even iteration and diagonalization will not suffice. I've no idea what such functions might look like: but they are all still computable! So here lies the frontier of pushing the upper limits of fast-growing computable functions. (Personally I think simply leaping to uncomputable functions is a cop-out... many people who will quickly name BBN in the arms-race of fast-growing functions have absolutely no idea how unimaginably huge it is... only by exploring what lies before it, can we truly appreciate how incredibly fast growing it is!) « Next Oldest | Next Newest »

 Messages In This Thread Tetration and higher-order operations on transfinite ordinals - by quickfur - 02/21/2008, 08:16 PM RE: Tetration and higher-order operations on transfinite ordinals - by quickfur - 02/23/2008, 03:33 AM RE: Tetration and higher-order operations on transfinite ordinals - by GFR - 02/23/2008, 09:47 AM RE: Tetration and higher-order operations on transfinite ordinals - by quickfur - 02/23/2008, 05:46 PM RE: Tetration and higher-order operations on transfinite ordinals - by GFR - 02/26/2008, 09:33 AM RE: Tetration and higher-order operations on transfinite ordinals - by quickfur - 03/28/2008, 10:55 PM RE: Tetration and higher-order operations on transfinite ordinals - by bo198214 - 03/29/2008, 09:58 AM RE: Tetration and higher-order operations on transfinite ordinals - by quickfur - 03/29/2008, 04:01 PM RE: Tetration and higher-order operations on transfinite ordinals - by quickfur - 08/16/2008, 01:58 AM

 Possibly Related Threads... Thread Author Replies Views Last Post Thoughts on hyper-operations of rational but non-integer orders? VSO 2 1,222 09/09/2019, 10:38 PM Last Post: tommy1729 Could there be an "arctic geometry" by raising the rank of all operations? Syzithryx 2 1,400 07/24/2019, 05:59 PM Last Post: Syzithryx Intresting ternary operations ? tommy1729 0 1,889 06/11/2015, 08:18 AM Last Post: tommy1729 on constructing hyper operations for bases > eta JmsNxn 1 3,211 04/08/2015, 09:18 PM Last Post: marraco Means and intermediate operations (was: Rational operators (a {t} b); a,b > e solved) Cherrina_Pixie 3 6,131 06/14/2011, 09:52 PM Last Post: JmsNxn Ackermann function and hyper operations andydude 3 7,549 04/18/2011, 05:08 PM Last Post: bo198214 Operations with fractional index between + and * ? Gottfried 6 9,727 10/21/2009, 01:30 AM Last Post: andydude Poll: hyper-operations terminology Base-Acid Tetration 3 6,109 08/22/2009, 05:08 PM Last Post: Base-Acid Tetration interesting pattern in hyper-operations Base-Acid Tetration 8 12,929 05/04/2009, 09:15 PM Last Post: BenStandeven Hilberdink: Uniqueness by order of growth? bo198214 2 4,179 05/30/2008, 12:29 AM Last Post: andydude

Users browsing this thread: 1 Guest(s)