zlacker
[parent]
[thread]
2 comments
1. Igglyb+(OP)
[view]
[source]
2016-01-26 02:36:27
Is the set of all turing machines finite?
replies(2):
>>govg+J1
>>qu4z-2+N1
◧
2. govg+J1
[view]
[source]
2016-01-26 03:17:19
>>Igglyb+(OP)
No, but they can be put in a 1-1 mapping with the integers, making them countably infinite.
◧
3. qu4z-2+N1
[view]
[source]
2016-01-26 03:18:40
>>Igglyb+(OP)
No, but it only needs to be countable, by my understanding.
[go to top]