Well, might as well start writing...
I've lately seen a few interesting things on the wiki, the Little Biggedon being one of them. Ultimately, I admire that we finally have yet another wiki record for the highest coined number officially present on the site; yet a matter comes to mind when reading through it.
That matter, my friends and colleagues, is something many of you may probably remember; the norminals function. The norminals, by their very design, are variables built in a way such that they will always be able to ascend beyond their old selves, and diagonalise their entire structure in a single step, every time. This does, of course raise the question "well, are 'norminals' well defined?" and the answer is, to a degree, no.
Norminals …Read more >
Well, I'll try to put this in the simplest terms (even though it's pretty simple either way).
(I know this is basically the Godel's-incompleteness-theorem thing, but we'll go on with it anyways.)
Let P be some formal system in which there are no contradictions between the axioms, and A be some axiom.
\(\forall P\exists A:A\not\in P\)
It almost seems trivial; but I'd stil like some nice formal proof.
We should also say that
\(\forall P\exists P':P'\not\subseteq P\)
But, well; I guess it's up for debate whether or not this is even necessary.
(We'll get to this once the previous are proven.)Read more >
25.8069758011Read more >
SGfdignfdivgskfjise nfkhbsdkvbdjfbsdvjhdbvjhdbvcjkzdxbncsjkbfsndicbnsjvdskfheu sdsjbchisdbvhsdcjsdbcnsdjcbsdjcinsdjvbshvbsdn bshv dsbchsdbchsdbsdhfbs hhbcshcbhsdbhdsfjenfieiwejieut8wefhweuf dfsifehjwfjd sds d dsdfjkdsbfsj kbfsh bdsh vdhabsdhdnfjeskfnjfknsdfjksbdueidnqjwkdn
Also,Read more >
In this blog post, I'm going to be comparing and explaining the norminals function to other already existing function on the wiki (as the title suggests); which will include the first few numbers I will be coining which are defined using the norminals function.
Due to the immense growth-rate of these functions, there won't be too much to compare it too; so feel free to ask me to add some additional functions for comparison below (i.e. specify which).
The first function, N(n); is defined identically to FOST(10n), making it just a tad faster-growing than the Rayo function. Of course, the reason that it's defined just the same way as FOST(10n) and not FOST(n), is in order to have interesting results fir lower n, such as 4, 10, etc.
Because the N…
Read more >