Skip to main content
Aaron Sterling's user avatar
Aaron Sterling's user avatar
Aaron Sterling's user avatar
Aaron Sterling
  • Member for 13 years, 10 months
  • Last seen more than 11 years ago
8 votes
Accepted

Hardness Guarantees for AES

8 votes

What are some real world applications for genetic algorithms?

7 votes

Are recursive forms of Godel's statement possible?

7 votes

Dinner-table description of theoretical computer science?

7 votes

Are there descriptive complexity representations of quantum complexity classes?

7 votes

Resources to learn about the P vs. NP problem

7 votes

Where does the information in a fractal come from?

6 votes

Why go to theoretical computer science/research?

6 votes

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

6 votes

Missing Wikipedia articles

6 votes

Universal Turing Machines in "Computational Complexity" by Papadimitriou

5 votes

Truly random number generator: Turing computable?

5 votes

Intermediate/Coding representation for Levenshtein Distance

5 votes

Formalizing a notion of machine Intelligence

5 votes

"Natural" decidable problems known not to be in NP.

4 votes
Accepted

Ant colony optimization for traveling salesman problem with changing graph-nodes/vertices

4 votes

Two Decision Problems About Graphs --- Original Results?

4 votes

Complexity lower bound for regular languages

4 votes
Accepted

Analysis of variables of varying numbers

4 votes

How can I model this usage scenario mathematically?

3 votes

Kolmogorov complexity applications in computational complexity

3 votes

Non-interesting numbers via resource-bounded properties?

1 vote
Accepted

What would it mean to disprove Church-Turing thesis?

1 vote

Text Analyze and Processing

1
2