Comments by "Chrysippus" (@4.0.4) on "Computers Without Memory - Computerphile" video.

  1. I don't understand. The FSA has a memory of one word, in this case up to 25 and worth say, 5 bits. What if its "single word" of memory was worth a trillion bits? And, it had a ridiculously large but technically finite graph of all the operations it could perform on that single word (or number) composed of a trillion bits? (In other words, couldn't you create a Turing complete machine with an absurdly complicated FSA?) As an example, he says you can't have the machine remember which coins led to 15, but adding a few bits to the number you could store that using a bit of math (mangling the number but it would still be extractable by a simple modulo).
    1
  2. I don't understand. The FSA has a memory of one word, in this case up to 25 and worth say, 5 bits. What if its "single word" of memory was worth a trillion bits? And, it had a ridiculously large but technically finite graph of all the operations it could perform on that single word (or number) composed of a trillion bits? (In other words, couldn't you create a Turing complete machine with an absurdly complicated FSA?) As an example, he says you can't have the machine remember which coins led to 15, but adding a few bits to the number you could store that using a bit of math (mangling the number but it would still be extractable by a simple modulo).
    1
  3. I don't understand. The FSA has a memory of one word, in this case up to 25 and worth say, 5 bits. What if its "single word" of memory was worth a trillion bits? And, it had a ridiculously large but technically finite graph of all the operations it could perform on that single word (or number) composed of a trillion bits? (In other words, couldn't you create a Turing complete machine with an absurdly complicated FSA?)
    1
  4. +Billy Sugger and booleans are stored as 4 bytes in many high level languages
    1