Načítá se...

Limit, logic, and computation

We introduce “ultrafilter limits” into the classical Turing model of computation and develop a paradigm for interpreting the problem of distinguishing the class P from NP as a logical problem of decidability. We use P(NP) to denote decision problems which can be solved on a (nondeterministic) Turing...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: Freedman, Michael H.
Médium: Artigo
Jazyk:Inglês
Vydáno: The National Academy of Sciences 1998
Témata:
On-line přístup:https://ncbi.nlm.nih.gov/pmc/articles/PMC18137/
https://ncbi.nlm.nih.gov/pubmed/9419334
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!