Collapius is defined as a number outputted from a function which embeds the sequence of the limit of a specific notation from integers. That notation must beat all well-defined recursive notations before reaching the fourth term of that limit sequence, in the terms of growth rates. It must have at most 3 extensions too.
It was coined in 11/10/21, by Aarex.
Sizes[]
There are infinitely many different sizes of Collapius, by changing the definition for the notation part: "That notation must beat all well-defined recursive notations before reaching the x-th term of that limit sequence, in the terms of growth rates."
Where x is a integer. Here are several names for Collapius sizes:
- Severe Collapius: x = 3
- Collapius: x = 4
- Sightly Collapius: x = 5
- Small Collapius: x = 6
Relations[]
- It must be mostly recursive, as there might no consistent sequences for nonrecursive functions.
- loader.c is not recursive, because D enumerates like a Busy Beaver function of CoC.