Re: Significance of "Relativizations of the P =? NP Question"
- From: examachine@xxxxxxxxx
- Date: 30 Jan 2006 07:23:26 -0800
tchow@xxxxxxxxxxxxx wrote:
> Let D be the set of all polynomially clocked DTM's that reject themselves
> as input.
That reject their DTM encodings and accept everything else?
And D is the language here? The decision problem is to recognize D? Or
if I am misunderstanding you, could you please clarify the problem a
bit
for me?
Best,
--
Eray
PS: I am not on a good reading day
.
- Follow-Ups:
- References:
- Significance of "Relativizations of the P =? NP Question"
- From: examachine
- Re: Significance of "Relativizations of the P =? NP Question"
- From: examachine
- Re: Significance of "Relativizations of the P =? NP Question"
- From: tchow
- Re: Significance of "Relativizations of the P =? NP Question"
- From: examachine
- Re: Significance of "Relativizations of the P =? NP Question"
- From: tchow
- Significance of "Relativizations of the P =? NP Question"
- Prev by Date: Re: Graph Theory question
- Next by Date: Re: Graph Theory question
- Previous by thread: Re: Significance of "Relativizations of the P =? NP Question"
- Next by thread: Re: Significance of "Relativizations of the P =? NP Question"
- Index(es):