CHAPTERSELECT | We
begin our development of a general theory of recursion by exploring the
work of the father of modern googology:
Jonathan Bowers. His work goes well beyond that of other amateurs and is
on par with the "fast-growing hierarchy" of professional mathematics!
His work has inspired many a would-be googologist, and his work has been the inspiration for even deeper studies into large
numbers and recursive functions. I would go so far as to say Jonathan Bowers' put googology on
the map! For this reason we will begin our study of
general recursion with Jonathan Bowers' infamous Exploding Array
Function (referred to whimsically as BEAF by Bowers himself)4.1.1 - The Infamous Jonathan Bowers : Who is Jonathan Bowers, and why is his work significant for the rest of our discussion throughout section IV? Read and find out.4.1.2 - Bowers' Extended Operator Notation : We now begin to reconstruct the early work of Jonathan Bowers. Here we explore his original 2002 Extended Operator Notation.4.1.3 - Bowers' Array Notation (ON HIATUS)4.1.4 - Bowers' Extended Array Notation (ON HIATUS)4.1.5 - Bowers' Super Extended, Exploding, & Super Extended Exploding Arrays (ON HIATUS) |

home >