
3
Looks like not a lot of people noticed, but we now have over 4000 pages on the wiki
Read more > 
Look at what I found at FOM:
1) Polynomial Shift Sequences http://www.cs.nyu.edu/pipermail/fom/2003June/006781.html Theorem 3 provides an e0recursive function that >* all f_a(n) for a
Read more > 
This is my C program for solving BEAF's linar arrays!
int solve_linear_array(int array[], int size) { assert(size >= 0 && array);
if (size == 0) { return 1; }
/* * "what if he gives you an array smaller than what "size" says it is?" * world peace happen. (and the program crashes, of course) */
/* {a} = a; */ if (size == 1) { return array[0]; }
if (size == 2) { while (array[1]) { array[0] *= array[0]; } return array[0]; }
int i, j; for (i = 2 ; i < size && array[i] == 1 ; i++); for (j = 2 ; j < i ; j++) { array[j] = array[0]; }
int *narray = calloc(size,â€¦
Read more > 
This is a simple program I made for calculating Hydra(n).
Say me if you see any error!!! =D
#include "ggy.h"
struct hydra { int children_count; struct hydra **children; struct hydra *parent; };
struct hydra *duplicate_hydra(struct hydra *hydra) { int i; struct hydra dup;
dup.children_count = hydra>children_count; dup.parent = hydra>parent;
for (i = 0 ; i < dup.children_count ; dup.children[i] = duplicate_hydra(hydra>children[i]));
return &dup; }
void unlink_hydra(struct hydra *hydra) { int i, j; struct hydra *parent = hydra>parent;
if (parent>children_count == 1) { parent>children_cound = 0; parent>children = NULL; } else {â€¦
Read more > 
Hey guys!
I made this C program for the fastgrowing hiearchy. It needs some explanations:
"ORD" structures aren't really ordinals (they aren't sets at all), but in theory f(ord,n) would solve exactly like f_ord(n) in the real FGH (i.e. give the same results)
The functions of the form f(DECL_ORD(OMEGA,k,0),n) would correspond to f_Ï†(k4,0)(n), and f(DECL_ORD(OMEGA,n,0),n) would therefore pretty much be f_Ï†(Ï‰,0)(n4)
ORD structures have the following members:
 p, another ordinal (e.g. in "Ï‰+4", p is the structure "representing" Ï‰). If it is "NULL", the ordinal is finite (e.g. 0,1,2,3,...)
 k, the "operation": letting o be the ORD object (of wich k is a
member)
 if k=0, o represents "p" (identity)
 if k=1, o represents "p+n" (addition)
 if k=2, o represenâ€¦