User blog:KthulhuHimself/I'm back, hopefully for more than a week

So every now and then I come back to the wiki for some fun. I've been working on two potentially interesting functions (one computable, one uncomputable) which expand upon and refine some of my previous ideas.

The computable function (actually an array notation) relies on a rather interesting system of countable ordinals to create gloriously massive patterns of recursion, then expand the recursive nature of the ordinal system to ordinals themselves (I'll explain this in the blog post itself).

The uncomputable function uses a simple and straightforward extension to first order set theory that allows it to create numbers larger than Rayo's. I can't say much where it lays in relation to other large uncomputables, but I'd imagine it to be at least somewhat stronger than Fish Number 7. If the simple extension to the language fails at creating something remarkable (I don't know how to compare this language to other extensions of FOST, I just know that in and of itself it's fairly expressive), I'll add a somewhat more interesting second clause to the extension which could well extend it beyond even the largest googologisms.

Since these are fairly straightforward notations, I'll be updating my blog soon.