Cargando...

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Freedman, Michael H.
Formato: Artigo
Lenguaje:Inglês
Publicado: The National Academy of Sciences 1998
Materias:
Acceso en línea:https://ncbi.nlm.nih.gov/pmc/articles/PMC18137/
https://ncbi.nlm.nih.gov/pubmed/9419334
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!