Timeline for Are there non-constructive algorithm existence proofs?
Current License: CC BY-SA 3.0
7 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/
|
|
| Mar 24, 2016 at 1:14 | comment | added | Daniel McLaury | I would be willing to bet a million dollars that $f$ is the constant 1 function. And I do not have a million dollars. | |
| Jul 30, 2012 at 18:30 | comment | added | Raphael | @jkff As simple as it is, it is a great exercise for students in intro TCS courses. It took me weeks to adjust my intuition/concept of computability in the light of this function. | |
| Jul 30, 2012 at 16:09 | vote | accept | jkff | ||
| Jul 30, 2012 at 16:09 | comment | added | jkff | I am, however, marking this one as "accepted" because it is by far the simplest one and demonstrates the core idea of how a non-constructive algorithm existence proof can arise. | |
| Jul 30, 2012 at 11:25 | comment | added | John Sidles | This answer is good, and so are the other answers. Evidently jkff's question has more than one answer, in the sense that there exist multiple proof technologies that can non-constructively demonstrate algorithm existence. | |
| Jul 30, 2012 at 8:52 | history | answered | Raphael | CC BY-SA 3.0 |