3 ms·
It couldn't be with a limited set of marbles could it?
by emmelaich 8y ago
It couldn't be with a limited set of marbles could it?
- baddox 8y agoI think it would be fair to call the system Turing complete if it is theoretically capable of addressing an arbitrary amount of memory. Of course, no physical computer or Turing machine actually has unbounded memory.
- shakna 8y ago> They also make the computer Turing-complete, which means that if the board were big enough, it could do anything a regular computer can do (in theory!). They do account for limited resources when they make the claim, thankfully.