Timeline for Infinite multiplicity set of continuous functions
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 26 at 8:09 | history | bounty ended | Kripke Platek | ||
| S Mar 26 at 8:09 | history | notice removed | Kripke Platek | ||
| Mar 26 at 8:09 | vote | accept | Kripke Platek | ||
| Mar 25 at 1:01 | answer | added | Joel David Hamkins | timeline score: 5 | |
| Mar 24 at 19:49 | comment | added | Steven Stadnicki | Doesn't Rice's theorem here mean that there is no way, given an algorithm as input, of doing what you want? | |
| Mar 24 at 19:30 | history | edited | Alex Ravsky |
edited tags
|
|
| Mar 22 at 16:45 | comment | added | YCor | OK. Note this is indeed a bit unusual to input an algorithm. | |
| Mar 22 at 14:52 | comment | added | Kripke Platek | @YCor Yes. By "effectively decide" I meant "compute". | |
| Mar 22 at 12:57 | comment | added | YCor | What does "effectively" mean here? do you mean, an algorithm whose input is an algorithm computing $E$ (i.e., telling whether an element is or is not in $E$), and whose output is whether $E$ is "constructable"? | |
| S Mar 22 at 9:30 | history | bounty started | Kripke Platek | ||
| S Mar 22 at 9:30 | history | notice added | Kripke Platek | Draw attention | |
| S Mar 10 at 17:29 | review | First questions | |||
| Mar 10 at 20:50 | |||||
| S Mar 10 at 17:29 | history | asked | Kripke Platek | CC BY-SA 4.0 |