4 ms·
But as I said, if programs are of infinite length, then a diagonalization argument proves the computable numbers not to be countable I think.
by gcanyon 2y ago
But as I said, if programs are of infinite length, then a diagonalization argument proves the computable numbers not to be countable I think.
- titanomachy 2y agoAh yes, of course you're right. I think it does make sense to assume the programs are finite, I don't think numbers described by an infinite program should be considered computable.