Googology Wiki
Advertisement
Googology Wiki

My Googology Playground

Trying to come up with strong recursion: [LINK] (Big W.I.P. btw)

Analysis of various things. (Bigger WIP btw)

Most formal symbols I use can be found in the links below:

Set Theory

Logic

I have some Ideas for strong computable functions, but however they will be an absolute pain to define. Some of them are:

-(Sequence) that is a (Smaller Sequence)[b]-sequence (Could possibly iterate this expansion nesting) (Probaply WAY to hard for me to define)

-A DSS based on (0,1,1)->(0,1,0,1,1,0,1,1,1,0,1,1,1,1...)

-A function that turns out to be basically the same as Friedmans Finite Promise games

Advertisement