Skip to main content
Computer Science
fade2black's user avatar
fade2black's user avatar
fade2black's user avatar
fade2black
  • Member for 7 years, 6 months
  • Last seen more than a week ago
  • Berlin, Germany
Profile Activity

2,092 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
TOC - Diagonal language is NP-hard
You should give a formal definition of the "diagonal language" in your post.
revised
Reduction function from A to its complement
deleted 43 characters in body
revised
Reduction function from A to its complement
added 298 characters in body
revised
Reduction function from A to its complement
added 2 characters in body
comment
Reduction function from A to its complement
I edited. Your def is correct.
revised
Reduction function from A to its complement
deleted 88 characters in body
answered
Reduction function from A to its complement
comment
Reduction function from A to its complement
Do you want to prove that $A \leq_T \overline{A}$ and $\overline{A} \leq_T A$ assuming $A = \{w : |w| > 3\}$?
reviewed
Approve
How to solve if we have $3^{(n-2)/2}$ in recurrence relation?
reviewed
Close
Is it beneficial to convert recursion to tail recursion?
reviewed
Close
what are the roles of Turing Machine?
reviewed
Close
Can we use recursion for large pool of input data?
reviewed
Close
Deadlock necessary conditions
reviewed
Approve
What is the time complexity of the following loop?
reviewed
Approve
Paths in a graph with two kinds of costs
reviewed
Approve
Is it possible to solve 3SUM in $O(n^2)$ time?
reviewed
Close
#3-Coloring Problem for Tree with Some Pre-Colored Nodes
reviewed
Close
Error correction codes - with strong noise
revised
Recognizability of machines which halt in $n$ steps on some input
edited body
answered
Recognizability of machines which halt in $n$ steps on some input
1
…
4 5
6
7 8
…
105