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 reference-request
Search options not deleted
user 38744
This tag is used if a reference is needed in a paper or textbook on a specific result.
18
votes
2
answers
704
views
Is Post's tag system solved?
Has the 3-tag system investigated by Emil Post $(0\to00, 1\to1101)$ been solved? Is there a decision algorithm to determine which starting strings terminate, which end up in a cycle, and which (if any …
- 2,811
3
votes
0
answers
122
views
Post correspondence problem: Busy beaver variant
The Post correspondence problem (Wikipedia link) is to decide for $k$ pairs of strings $$(a_1,b_1), (a_2, b_2), ..., (a_k,b_k),$$ if there exists a finite sequence of numbers $c_j, 0\le j\le j_\max $ …
- 2,811
5
votes
Strategy-stealing in chess
I think the real essence of the question is not so much in whether zugzwang exists in chess, but whether it exists in the first few (say 5) moves, and whether in that time white can effectively lose a …
- 2,811
10
votes
5
answers
763
views
Reference request: Diophantine equations
I am looking for a textbook, or preferably lectures, on the subject of Diophantine equations. I am familiar with the basic principles of modular arithmetic, conics and the Hasse Principle, and the bas …
- 2,811