Mmmhhhh.... Arithmetic in computers is bot infinite, so one might have a consistence theorem for "computers with arithmetic modulo 2^3000" for example.
Assuming that the computer programs under study aren't allowed to interact with a disk, of course. :-)