There'd be a whole lot of programs. There's a good reading that approaches a related subject, but isn't specific to C programs: http://www.scottaaronson.com/wr

There'd be a whole lot of programs. There's a good reading that approaches a related subject, but isn't specific to C programs: http://www.scottaaronson.com/writings/bignumbers.html http://www.scottaaronson.com/writings/bignumbers.html In short, `busy beaver number' -- number of steps that a halting Turing machine with dictionary of size N can have -- grows pretty fast with N; faster than Ackermann function anyway. Also, supposedly a katamari is the only thing which outgrows the busy beaver sequence ;) http://www.xamuel.com/katamari-damacy-growth/ http://www.xamuel.com/katamari-damacy-growth/