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 reply to* **Re: A mod2 Machine.**
*by* **Lawliet**
*in thread* **A mod2 Machine.**
*by* **code-ninja**

- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

For: |
Use: |
||

& | & | ||

< | < | ||

> | > | ||

[ | [ | ||

] | ] |