ConceptAI & ML
Numerical computation of B(N,k) bound
Computing upper bounds for the growth function values using a recursive table construction.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Growth function recurrence relation1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.