user avatar
user avatar
user avatar
rb612
  • Member for 6 years, 2 months
  • Last seen more than a month ago
6 votes
1 answer
917 views

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

1 vote
0 answers
36 views

How is it possible that an equational theory be terminating?

1 vote
1 answer
26 views

Injectivity not required for unification algorithms?

2 votes
1 answer
105 views

Questions on Sipser's NP implying verifiability?

1 vote
1 answer
267 views

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

0 votes
1 answer
48 views

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

1 vote
0 answers
146 views

Second-order Markov text generation?

1 vote
1 answer
203 views

General Intelligence Utility Function

3 votes
2 answers
822 views

How are games like chess provably harder than NP?

4 votes
2 answers
1k views

What complexity class would this version of generalized chess fall?

2 votes
1 answer
373 views

How does (non)deterministic time relate to verifiability?

7 votes
1 answer
2k views

How do we know for sure that EXPTIME ≠ P?