Better:
A is not a toy. It is a lens through which we glimpse the infinite structure of ordinals and the staggering creativity of recursive function theory. A high-quality calculator respects the complexity of the subject: it handles arbitrary ordinals, respects different fundamental sequences, traces recursion faithfully, and never pretends that a Googolplex is "large." fast growing hierarchy calculator high quality
fα+1(n)=fαn(n)=fα(fα(…fα(n)…))⏟n timesf sub alpha plus 1 end-sub of n equals f sub alpha to the n-th power of n equals modified f sub alpha of open paren f sub alpha of open paren … f sub alpha of n … close paren close paren with under brace below with n times below : For a limit ordinal , the function "diagonalizes" over a fundamental sequence λ[n]lambda open bracket n close bracket Better: A is not a toy