Timeline for Computability of prime difference function
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2017 at 14:55 | vote | accept | Dominic van der Zypen | ||
| Sep 28, 2017 at 8:51 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 8 characters in body
|
| Sep 22, 2015 at 11:22 | vote | accept | Dominic van der Zypen | ||
| Sep 22, 2015 at 13:58 | |||||
| Sep 22, 2015 at 10:49 | comment | added | Dominic van der Zypen | Do some people "in the know" think that the twin prime conjecture might be undecidable? | |
| Sep 22, 2015 at 10:45 | answer | added | Joel David Hamkins | timeline score: 2 | |
| Sep 22, 2015 at 10:40 | comment | added | Stefan Kohl♦ | Likely it is just $f(n) = 0$ if $n$ is odd, and $f(n) = 1$ if $n$ is even, and thus $f$ is computable -- but whether this really is so is of course an open problem. | |
| Sep 22, 2015 at 10:31 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |