P not= NP for infinite time Turing machines

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
2 pages

Citation

Consulte el texto completo en el siguiente enlace:

Collections