in reply to A mod2 Machine.

a bona fide integer will be treated mathematically, hence taking more time

...more time in a small enough base. Given a base that requires twice *the number of symbols needed to represent every digit* than *the number of operations it takes to compare one symbol to every symbol*, your statement doesn't hold (italics for readability).

Just poking fun. I thought it was a good writeup and an interesting observation ;).

In Section
Meditations

Comment onRe: A mod2 Machine.