Timeline for Meta-computational complexity?
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2019 at 9:25 | comment | added | user56834 | "As long as you don't take proper care to distingish between finite input and infinite input, and implicitly assume that the input is always finite" I wasn't assuming the input is finite. I also didn't specify how it would be infinite (more accurately, unbounded), but that's because I'm asking whether a theory on roughly this topic exists. I'm not proposing the theory myself. Apart from this, yes the minimum circuit size problem is interesting, thank you. :) | |
| May 2, 2019 at 8:53 | history | answered | Thomas Klimpel | CC BY-SA 4.0 |