Area VIII
Turing machines, recursive functions, and the Akra–Bazzi law of recurrences.
0/4 rooms
Pathway XXVII
A tape, a head, a finite table of rules. Recursive functions are what the machine can write.
0/2 rooms
Pathway XXVIII
The master theorem’s grown form: recurrences T(n) = g(n) + Σ aᵢ T(bᵢ n) have an integral closed form.