2 ms·
Mmmhhhh.... Arithmetic in computers is bot infinite, so one might have a consistence theorem for "computers with arithmetic modulo 2^3000" for example.
by pfortuny 10y ago
Mmmhhhh.... Arithmetic in computers is bot infinite, so one might have a consistence theorem for "computers with arithmetic modulo 2^3000" for example.
- schoen 10y agoYour exponent is a bit too small, though; it should be 2^(number of bits of RAM), like 2^34359738368 for a computer with 4 GB RAM (plus a little bit for CPU registers). Assuming that the computer programs under study aren't allowed to interact with a disk, of course. :-)
- aruggirello 10y agoOr with the Internet :-D