Skip to main content
rb612's user avatar
rb612's user avatar
rb612's user avatar
rb612
  • Member for 8 years
  • Last seen more than a month ago
8 votes
1 answer
4k views

How do we know for sure that EXPTIME ≠ P?

5 votes
2 answers
1k views

What complexity class would this version of generalized chess fall?

6 votes
1 answer
1k views

Is EXPTIME "solvable" or "checkable" in exponential time?

4 votes
2 answers
1k views

How are games like chess provably harder than NP?

4 votes
1 answer
796 views

How does (non)deterministic time relate to verifiability?

2 votes
1 answer
520 views

NP and verifiability equivalence - does this guarantee that any certificate can be verified in polynomial time?

1 vote
1 answer
210 views

General Intelligence Utility Function

1 vote
0 answers
151 views

Second-order Markov text generation?

2 votes
1 answer
127 views

Questions on Sipser's NP implying verifiability?

0 votes
1 answer
73 views

Looping through random integers - will it halt with probability 1?

1 vote
0 answers
39 views

How is it possible that an equational theory be terminating?

1 vote
1 answer
29 views

Injectivity not required for unification algorithms?