3 ms·
Why not? I realise there are non-Turing complete models of computation that cannot be described by a lookup table (e.g. coinduction), but are they physically r
by bidirectional 6y ago
Why not? I realise there are non-Turing complete models of computation that cannot be described by a lookup table (e.g. coinduction), but are they physically realisable?
- adamnemecek 6y agoAnyone who says anything besides “I don’t know” is lying.