Problems in NP with infinite number of possibiltiies to check?

From: Richard Hayden <rah03@xxxxxxxxxxxxxxxxxxx>
Date: Fri, 22 Apr 2005 21:27:22 +0100

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hi,

Are problems where you are trying to find if a possibility for something
exists out of a infinite number of possibilites in NP if checking
whether or not they are a possibility is in P?

Thanks,

Richard Hayden.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.6 (GNU/Linux)
Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org

iD8DBQFCaV4p1y4M4bx2DkwRAsevAKC+D4jAiUVj51ax4Lb+gZ8DaGos4ACdErkE
cujrf4cwSDCYL6zlFcLN7GQ=
=5f5k
-----END PGP SIGNATURE-----
.

Follow-Ups:
- Re: Problems in NP with infinite number of possibiltiies to check?
  - From: tchow
- Re: Problems in NP with infinite number of possibiltiies to check?
  - From: jarfo

Prev by Date: Re: P=NP: Linear Programming Formulation of the TSP
Next by Date: Re: Problems in NP with infinite number of possibiltiies to check?
Previous by thread: Re: P=NP: Linear Programming Formulation of the TSP
Next by thread: Re: Problems in NP with infinite number of possibiltiies to check?
Index(es):
- Date
- Thread

Relevant Pages

Re: BUG in 2.6.18.1?
... Hmmm... ... 21 is infinite? ... I find that it would be interesting to me personally if the kernel was ... Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org ...
(Linux-Kernel)
Re: Problems in NP with infinite number of possibiltiies to check?
... >exists out of a infinite number of possibilites in NP if checking ... Dialogues Concerning Two New Sciences ... Prev by Date: ...
(comp.theory)