Timeline for How does "language" relate to "problem" in complexity theory?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2014 at 11:28 | comment | added | Raphael | You may want to add your thoughts to our reference question. | |
| Dec 3, 2014 at 10:01 | comment | added | reinierpost | A problem doesn't take in anything. The problem is to decide, given a string, whether it belongs to a certain language. It is an algorithm for solving the problem that takes in a string. | |
| Dec 3, 2014 at 5:00 | vote | accept | Fraïssé | ||
| Dec 3, 2014 at 4:21 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 1477 characters in body
|
| Dec 3, 2014 at 3:57 | comment | added | Fraïssé | Very intriguing answer, but can you provide a simple example on what a problem may be phrase as, and what a string looks like? I'm still not comfortable with a problem taking in a string, is a problem in this case the same as a function and string the same as the argument? | |
| Dec 3, 2014 at 3:46 | history | answered | Yuval Filmus | CC BY-SA 3.0 |