[1] Lipton, R. DNA solution of hard computational problems. Science 268 (1995), 542-545.
[2] Head, T. Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3. Lecture Notes In Computer Science; Vol. 2340
Still, regardless of whether P!=NP, it is known that P is contained in NP which is contained in PSPACE. These classes are defined for certain computational models. If you change the computational model then those definitions might not make sense.
For under $500 ...
EDIT: here's a link to a paper describing this approach: http://www.springerlink.com/content/j5213p8761224304/
[1] Lipton, R. DNA solution of hard computational problems. Science 268 (1995), 542-545.
[2] Head, T. Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3. Lecture Notes In Computer Science; Vol. 2340