Cobham-Edmonds thesis correctly identifies a robust complexity class; O(n^100) algorithms are vanish...
This proposition has not been edited since the history system was added.