Cobham's thesis

Revision as of 13:39, 12 May 2013 by Dank (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The assertion that only those problems in P are efficiently computable.

Retrieved from "https://nick-black.com/dankwiki/index.php?title=Cobham%27s_thesis&oldid=5432"

Computer Science Eponyms