Timeline for Generating general term of union of two countably infinite sets
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2016 at 23:49 | answer | added | Gilles 'SO- stop being evil' | timeline score: 2 | |
| Mar 7, 2016 at 21:24 | comment | added | David Richerby | If you're going to ask for algorithms, an algorithm needs a finite input. So how are you representing these infinite sets? Any answer will depend very much on this kind of detail. You probably want to be looking at computability theory and, in particular, recursive and recursively enumerable sets. That's a big area so not really something that can be covered in a single Stack Exchange answer. | |
| Mar 7, 2016 at 19:11 | review | Close votes | |||
| Mar 11, 2016 at 21:29 | |||||
| Mar 7, 2016 at 19:05 | answer | added | Sarvottamananda | timeline score: 2 | |
| S Mar 7, 2016 at 18:57 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
improved grammar and spacing
|
| S Mar 7, 2016 at 18:57 | history | suggested | user12859 | CC BY-SA 3.0 |
improved grammar and spacing
|
| Mar 7, 2016 at 18:49 | review | Suggested edits | |||
| S Mar 7, 2016 at 18:57 | |||||
| Mar 7, 2016 at 18:20 | review | First posts | |||
| Mar 8, 2016 at 2:42 | |||||
| Mar 7, 2016 at 18:19 | history | asked | Kshitij Saraogi | CC BY-SA 3.0 |