3 ms·
Turing machines are countable. In some constructive settings, every real number is computable, as an axiom; those settings allow us to talk about the Turing mac
by myWindoonn 5y ago
Turing machines are countable. In some constructive settings, every real number is computable, as an axiom; those settings allow us to talk about the Turing machines which compute a particular real number.