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 open-problems
Search options not deleted
user 4600
If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it before, and with what results?"
13
votes
Accepted
Can any finite lattice be realized as an intermediate subgroups lattice?
This is an open problem. See
Wikipedia article: http://en.m.wikipedia.org/wiki/Finite_lattice_representation_problem
Palfy and Pudlak's result (see open-source description in Palfy's article Interva …
- 24.8k
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 …
- 24.8k