|
Post by P1kachu on Jul 11, 2015 0:03:35 GMT
f eââe(100) Where â represents the up arrow notation, but downwards ( ͡° ÍÊ Í¡Â°) down-arrow notation exists, but it is a primitive recursive function, nothing to see with your function It's by my own definition ( ͡° ͜ʖ ͡°)
|
|
|
Post by 《§》carbonara <3〖ƧƐ〗 on Jul 11, 2015 7:20:40 GMT
down-arrow notation exists, but it is a primitive recursive function, nothing to see with your function It's by my own definition ( ͡° ͜ʖ ͡°) you can't define a notation which conflict with another.
|
|
|
Post by P1kachu on Jul 11, 2015 9:53:45 GMT
It's by my own definition ( ͡° ÍÊ Í¡Â°) you can't define a notation which conflict with another. Let D n(k) = k kkkkk... Where there are n k's ( ͡° ͜ʖ ͡°)
|
|
|
Post by 《§》carbonara <3〖ƧƐ〗 on Jul 11, 2015 11:05:18 GMT
you can't define a notation which conflict with another. Let D n(k) = k kkkkk... Where there are n k's ( ͡° ͜ʖ ͡°) what is the final subscript? 0? My turn: φ(0,0) = ω, φ(0,β) = ω βφ(1,0) = ω ω... = ε 0, φ(1,β) = ε βφ(2,0) = ε εε...ε0 = ζ 0, φ(2,β) = ζ βφ(3,0) = ζ ζζ...ζ0 = η 0, φ(3,β) = η βFormal definition: φ(α,β) is the (β+1)th fixed point of φ(α-1,0) if α is a successor, otherwise the limit of φ(α,φ(α,φ(...(φ(α,0))...)) φ(φ(φ(...(φ(0,0)...),0),0) = Γ 0 (the first fixed point of this function: Γ 0 = φ(Γ 0,0)) This is the Veblen's hiearchy. My entry is: f φ(69,69)(10 100) ( ͡° ͜ʖ ͡°)
|
|
|
Post by P1kachu on Jul 12, 2015 0:04:13 GMT
fÏ(69,69)(fÏ(69,69)(fÏ(69,69)(10100))) ( ͡° ͜ʖ ͡°)
|
|
|
Post by 《§》carbonara <3〖ƧƐ〗 on Jul 15, 2015 15:16:49 GMT
f φ(69,69)(f φ(69,69)(f φ(69,69)(10 100))) ( ͡° ͜ʖ ͡°) Read again, FGH has missing parameters xP
|
|
|
Post by 10^1 on Mar 14, 2021 6:35:03 GMT
10^1
|
|
|
Post by 10^100 on Mar 14, 2021 6:35:45 GMT
10^100
|
|