One thought on “${\rm P}^f\neq {\rm NP}^f$ for almost all $f$

  1. Pingback: P not= NP intersect coNP for infinite time Turing machines | Joel David Hamkins

Leave a Reply

Your email address will not be published. Required fields are marked *

*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>