rb612
  • Member for 5 years, 8 months
  • Last seen more than a week ago
1 answers
6 votes
875 views
1 bookmarks
Is EXPTIME "solvable" or "checkable" in exponential time?
0 answers
1 votes
32 views
How is it possible that an equational theory be terminating?
1 answers
1 votes
24 views
Injectivity not required for unification algorithms?
1 answers
2 votes
101 views
Questions on Sipser's NP implying verifiability?
1 answers
1 votes
232 views
NP and verifiability equivalence - does this guarantee that any certificate can be verified in polynomial time?
1 answers
0 votes
46 views
Looping through random integers - will it halt with probability 1?
0 answers
1 votes
142 views
Second-order Markov text generation?
1 answers
1 votes
198 views
General Intelligence Utility Function
2 answers
3 votes
745 views
1 bookmarks
How are games like chess provably harder than NP?
2 answers
4 votes
1k views
What complexity class would this version of generalized chess fall?
1 answers
2 votes
316 views
How does (non)deterministic time relate to verifiability?
1 answers
6 votes
2k views
1 bookmarks
How do we know for sure that EXPTIME ≠ P?