P not= NP for infinite time Turing machines

Simple item page
dc.creatorSchindler, Ralf
dc.date2001-06-11
dc.date.accessioned2026-07-07T04:42:06Z
dc.date.available2026-07-07T04:42:06Z
dc.descriptionWe state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/math/0106087
dc.identifierhttp://arxiv.org/abs/math/0106087
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61631
dc.subjectLogic
dc.subject68Q15;03E15
dc.titleP not= NP for infinite time Turing machines
dc.typetext

Files

Collections

arXiv