P != NP question

From: gleezebang@xxxxxxxxx
Date: Mon, 28 May 2012 12:19:10 -0700 (PDT)

OK.

Let's get on the bandwagon and suppose P != NP.

NP (def)= Union_{k\in\omega} NTIME(n^k).

(\omega is the same as the natural numbers)

Since P != NP, there is a language L \in NP = Union_k blah blah
such that L \not\in P.

Which k is it?

.

Follow-Ups:
- Re: P != NP question
  - From: gleezebang
- Re: P != NP question
  - From: os_rook
- Re: P != NP question
  - From: gleezebang

Prev by Date: Re: Which Context-free Languages are accepted by Deterministic Pushdown Automata?
Next by Date: Re: ALL PERMUTATIONS OF INFINITY
Previous by thread: Detecting When a Tree of Threads Has Completed
Next by thread: Re: P != NP question
Index(es):
- Date
- Thread

Relevant Pages

Re: P != NP question
... Let's get on the bandwagon and suppose P!= NP. ... NP (def)= Union_NTIME. ... there is a language L \in NP = Union_k blah blah ... on the other side, has anyone tried to hash the computation trees, to simulate non-determinism? ...
(comp.theory)
Re: P != NP question
... Let's get on the bandwagon and suppose P!= NP. ... NP (def)= Union_NTIME. ... there is a language L \in NP = Union_k blah blah ... Obviously, if any language is in NP but not P, then SAT is such a ...
(comp.theory)
Re: P != NP question
... Let's get on the bandwagon and suppose P!= NP. ... NP (def)= Union_NTIME. ... there is a language L \in NP = Union_k blah blah ... on the other side, has anyone tried to hash the computation trees, to simulate non-determinism? ...
(comp.theory)
Re: P != NP question
... Let's get on the bandwagon and suppose P!= NP. ... NP (def)= Union_NTIME. ... there is a language L \in NP = Union_k blah blah ...
(comp.theory)
Re: P != NP question
... Let's get on the bandwagon and suppose P!= NP. ... NP (def)= Union_NTIME. ... there is a language L \in NP = Union_k blah blah ... having completely lost confidence here... ...
(comp.theory)