Aarex's Graham Generator is a googological function, based on Graham's function, invented by Aarex Tiaokhiao and notated as Forcala,b,#(n). Formally it is defined as follows:
* # is the rest of the array
* @ is a string of consecutive 1's (or can be empty)
* Rule 1. When the only entry is 1 Forcal1(n) = GForcal1(n-1) (G stands for Graham's function)
* Rule 2. When n=0: Forcal#(0) = 1000000
* Rule 3. a=1 and b>1: Forcal@,1,b,#(n) = Forcal@,Forcal@,1,b,#(n-1),b-1,#(1)
* Rule 4. No subscripts: Forcal(n) = Forcal1(n)
* Rule 5. Rules 1-4 don't apply: Forcala,#(n) = Forcala-1,#(Forcala,#(n-1))
Attributes | Values |
---|
rdfs:label
| |
rdfs:comment
| - Aarex's Graham Generator is a googological function, based on Graham's function, invented by Aarex Tiaokhiao and notated as Forcala,b,#(n). Formally it is defined as follows:
* # is the rest of the array
* @ is a string of consecutive 1's (or can be empty)
* Rule 1. When the only entry is 1 Forcal1(n) = GForcal1(n-1) (G stands for Graham's function)
* Rule 2. When n=0: Forcal#(0) = 1000000
* Rule 3. a=1 and b>1: Forcal@,1,b,#(n) = Forcal@,Forcal@,1,b,#(n-1),b-1,#(1)
* Rule 4. No subscripts: Forcal(n) = Forcal1(n)
* Rule 5. Rules 1-4 don't apply: Forcala,#(n) = Forcala-1,#(Forcala,#(n-1))
|
dcterms:subject
| |
dbkwik:googology/p...iPageUsesTemplate
| |
abstract
| - Aarex's Graham Generator is a googological function, based on Graham's function, invented by Aarex Tiaokhiao and notated as Forcala,b,#(n). Formally it is defined as follows:
* # is the rest of the array
* @ is a string of consecutive 1's (or can be empty)
* Rule 1. When the only entry is 1 Forcal1(n) = GForcal1(n-1) (G stands for Graham's function)
* Rule 2. When n=0: Forcal#(0) = 1000000
* Rule 3. a=1 and b>1: Forcal@,1,b,#(n) = Forcal@,Forcal@,1,b,#(n-1),b-1,#(1)
* Rule 4. No subscripts: Forcal(n) = Forcal1(n)
* Rule 5. Rules 1-4 don't apply: Forcala,#(n) = Forcala-1,#(Forcala,#(n-1))
|