4 ms·
This is like saying that no programming language is Turing-complete since they are all implemented with finite memory.
by Klockan 10y ago
This is like saying that no programming language is Turing-complete since they are all implemented with finite memory.