Timeline for Is the set of Gödel numbers of computable constant functions recursively enumerable?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Jan 18, 2014 at 18:57 | comment | added | Raphael | It comes up in different places in theory (also complexity theory) but I don't know of a name. There may be one, though; maybe ask a terminology question? | |
| Jan 18, 2014 at 18:54 | history | edited | Raphael | CC BY-SA 3.0 |
adds an digression on a subtlety
|
| Jan 17, 2014 at 23:54 | comment | added | PALEN | I've seen that construction of 'if it halts after at most steps then something else something' many times now. Is it usually useful? Is it a common method? I mean, it may have a proper name. If it does, could you point me to a reading? | |
| Jan 17, 2014 at 18:13 | vote | accept | PALEN | ||
| Jan 17, 2014 at 16:37 | history | answered | Raphael | CC BY-SA 3.0 |