4 ms·
I have a gripe with the opener. > At Clearspring we like to count things. Counting the number of distinct elements (the cardinality) of a set is challenge when
by mvanveen 15y ago
I have a gripe with the opener.
> At Clearspring we like to count things. Counting the number of distinct elements (the cardinality) of a set is challenge when the cardinality of the set is large.
On a turing machine, you're always operating on sets with the same cardinality as the integers.
- Daniel_Newby 15y agoComputers are finite, and so is Clearspring's data.
- zitterbewegung 15y agoThat would be cool if you actually had a Turing machine. Most people have a deterministic linear bounded automata.
- jasonwatkinspdx 15y agoThis is the same as saying Turing machines cannot operate on finite sets, which is clearly wrong.
- mvanveen 15y agosince when is the set of integers a finite set? Without understanding you argument more fully, I don't see how this follows at all.
- deleted 15y ago[deleted]
- dpark 15y agoSince never. That's the opposite of what he was saying. You: Turing machines only operate on sets with the same cardinality as the set of integers. Jason: Integers are not a finite set. Jason: Therefore Turing machines cannot operate on finite sets.