Why am I here?
If you were sent here, somebody thought that your question lacked depth or displayed ignorance of basic knowledge and/or techniques one would learn in undergraduate courses. This is not your fault, but for us who write answers it has become a chore to explain the same things over and over again (many such questions arise from homework, and homework problems do not differ a lot).
Therefore, we have compiled a list of questions that are of general nature and have answers that should apply in a variety of situations. Please take the time to browse through those relevant to your question; chances are that we already have you covered. If not, it is likely that one of two things has happend:
You don't understand the reference material.
In this case, the best response is to do further research. That includes picking up textbooks (the reference answers may list some) and asking focused questions on the main site.You understand the material, but you can not apply it to your situation.
In this case, edit your old question to include your attempts at solving the problem and why they failed. Then flag it for reopening; with this new information, we can help you identify your specific problem and move forward.
Remember: "I don't understand any of this, please explain in plain English!" is a bad enquiry. Nobody can know what your problem really is, which factoid would help you understand, and what the required scope for a good answer is. Try instead to phrase questions like "In above proof, why does B follow from A?" or "I have an algorithm but it seems to be wrong for corner case X, how can I fix it?"
That said, here is the list of reference posts:
Formal Languages
- How to show that L = L(G)?
- How to prove that a language is not regular?
- How to prove a language is regular?
- How to convert finite automata to regular expressions?
- How to prove that a language is not context-free?
- Language theoretic comparison of LL and LR grammars
Complexity
- In basic terms, what is the definition of P, NP, NP-Complete, and NP-Hard?
- What are common techniques for reducing problems to each other?
- How not to solve P=NP?
- Dealing with intractability: NP-complete problems
Asymptotics
- How does one know which notation of time complexity analysis to use?
- Sorting functions by asymptotic growth
- Solving or approximating recurrence relations for sequences of numbers
Architecture
- How does a computer work?
- How does the computer determine whether a number is smaller or greater than another?
Computability
- How to show that a function is not computable?
- What are common techniques for reducing problems to each other?