Re: P vs NP: my proof of P != NP
From: Jim Nastos (nastos_at_cs.ualberta.ca)
Date: 04/04/04
- Next message: The Ghost In The Machine: "Re: functions that halt"
- Previous message: |-|erc: "Re: functions that halt"
- In reply to: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Next in thread: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Reply: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sat, 3 Apr 2004 17:30:34 -0700
On Sat, 3 Apr 2004, Mikhail N. Kupchik wrote:
> Time of reduction of one problem A from P (with unlimited complexity degree)
Can you briefly explain what "unlimited complexity degree" is? In
particular, with respect to some language A of P.
J
- Next message: The Ghost In The Machine: "Re: functions that halt"
- Previous message: |-|erc: "Re: functions that halt"
- In reply to: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Next in thread: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Reply: Mikhail N. Kupchik: "Re: P vs NP: my proof of P != NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
