Former Largest Number |
---|
"True Absolute Insurmountable Limit" has once been the largest number on this wiki, but has been surpassed by a different number. |
"The Ultimate Trans-transcendental Definitive-Conceptual-Argumentative Limit is an entry on the Fictional Googology Wiki that outranks all others in terms of hypothetical pseudo-hyper-quantification." - Ultimate Trans-transcendental Definitive Conceptual Argumentative Limit |
Let’s define a system where f(0) is 0, f(1) is the largest number definable using basic numbers, f(2) is the largest number definable using standard mathematical functions, f(3) is the largest number definable using googological notation, f(4) is the largest number in fictional googology (including this number), and you can continue this function infinitely. TAIL (Without boosters) is f{P.I.E.L.}P.I.E.L.(P.I.E.L.) using this function, and extended function iteration[1][2]. Due to the fact that P.I.E.L. is used in this number, P.I.E.L. can't surpass this in any way, but there should be boosters to this for it to truly claim the title of "largest number".
Boosters[]
Function Increaser[]
This takes all functions that increase the size of a number, and nests them f{TAIL}TAIL(TAIL) times (function defined at the beginning). You may be asking, "How does it use TAIL nests when the number itself is TAIL?" Well, it does this process f{TAIL}TAIL(TAIL) times every 0 seconds, and it starts with the unmodified version of TAIL, then it uses the previous version of TAIL.
Number Copier[]
This finds all numbers in existence that are over 0, and adds it to TAIL. It does this every 0 seconds.
Number Copier Sub-Booster[]
This finds all numbers that aren't in existence that are over 0, and adds it to TAIL. It also does this every 0 seconds.
Attack Nullifier[]
This finds any number larger than this, and nullifies it so that it's equal to 0. If it bypasses/is immune to this, it bypasses its bypass/immunity, if it bypasses that, this bypasses that, etc.
The Singularity[]
It uses the most powerful singularity, which is always f{TAIL}TAIL(TAIL) times smarter than itself, and uses it to find the most powerful way to increase itself, and it does it f{TAIL}TAIL(TAIL) times every 0 seconds.
Task Converter[]
This converts tasks to numbers, and if they're above 0, it adds it to TAIL. It does this every 0 seconds. A task could vary from waking up to destroying The Box and recreating it perfectly. There are obviously tasks easier and harder than those two. It converts tasks by taking the easiest task ever, and counts the minimum amount of times you must eat the easiest task ever for it to be harder than the task. The easiest task ever is the easiest task that either will or won't be defined in the plane of existence's life.
- ↑ https://docs.google.com/document/d/1sNQwUAxbc5YSjedRdmO_A0CBu6y62j6KxkSl6lXR7OA/edit?usp=sharing Extended function iteration
- ↑ https://docs.google.com/document/d/1rfj4QXbxnoypCOI4aRC-liXHUCFL6NNJQbPf2AsqW2s/edit Origin of the function, see "Namenamename".