  We use fast-growing finite and infinite sequences of natural numbers and more
complicated constructs to define models of hypercomputation and interpret
non-arithmetic predicates, with the strongest extensions reaching full second
order arithmetical truth and beyond. Since the predicates are interpreted using
properties of certain natural finite structures, they are arguably finitistic.
