Ted
  • Member for 4 years, 3 months
  • Last seen more than a month ago
1 answers
6 votes
1k views
2 bookmarks
Proving that the set of deciders is not Turing-recognizable
2 answers
4 votes
434 views
1 bookmarks
A several equivalent NP definitions
1 answers
1 votes
1k views
decidability about intersection of regular language and context free language
2 answers
1 votes
4k views
NFA accepting the empty string
1 answers
1 votes
689 views
1 bookmarks
How to show that any computable function is bounded above by Busy Beaver Function?
1 answers
1 votes
620 views
decidability about NFA accepting an input
1 answers
1 votes
650 views
Finding integrality gap for maximum weight independent set
0 answers
1 votes
56 views
minimal packing analysis using greedy
0 answers
1 votes
77 views
Intuition behind approximation algorithm
1 answers
1 votes
608 views
NP-completeness of triangle removal problem
1 answers
0 votes
2k views
Concatenation of two Turing machines
1 answers
0 votes
195 views
Unary Turing-unrecognizable language
0 answers
0 votes
680 views
Combining two Turing machines