Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with collatz-conjecture
Search options not deleted
user 4600
The Collatz Conjecture, also known as the 3n+1 conjecture, is a famous open problem named after Lothar Collatz.
33
votes
Accepted
Is there a known Turing machine which halts if and only if the Collatz conjecture has a coun...
$\newcommand\PA{\mathit{PA}}$Let's note that this is not a question of whether Collatz is undecidable.
The statement $\neg\mathrm{Con}(\PA)$ is undecidable (by $\PA$, assuming $PA$ is consistent) but …
- 12.9k