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 computer-science
Search options not deleted
user 35626
For question borderline with, or having application to, computer science. Consider also posting http://cs.stackexchange.com/ or http://cstheory.stackexchange.com/ instead of here, if appropriate.
6
votes
Can We Decide Whether Small Computer Programs Halt?
On the flip side, one can write a program that does the
Collatz sequence or walks through an enumeration of
natural number vectors to see if it has a solution to some
Diophantine equation whose solubi …
- 2,158
4
votes
Mathematics of privacy?
I don't know what you can expect. You might be interested in work of Cynthia Dwork on the concept of differential privacy. The idea concerns what information can be revealed by queries to a database …
- 2,158
1
vote
Accepted
How many edges can you put in a graph such that every edge belongs to a minimal $k$-cycle?
Here is a rough analysis to start things off. k=3 corresponds to a complete graph, and
k=4 to a complete bipartite graph with the vertex set split as evenly as possible. (I don't
see an easy proof of …
- 2,158