Re: *sniff* [CC'ed to the Noct Cabal] -- The Noct Cabal

[ Show ]

Support VoyForums

[ Shrink ]

VoyForums Announcement: Programming and providing support for this service has been a labor of love since 1997. We are one of the few services online who values our users' privacy, and have never sold your information. We have even fought hard to defend your privacy in legal cases; however, we've done it with almost no financial support -- paying out of pocket to continue providing the service. Due to the issues imposed on us by advertisers, we also stopped hosting most ads on the forums many years ago. We hope you appreciate our efforts.

Show your support by donating any amount. (Note: We are still technically a for-profit company, so your contribution is not tax-deductible.) PayPal Acct: Feedback:

Donate to VoyForums (PayPal):

[ Login ] [ Contact Forum Admin ] [ Main index ] [ Post a new message ] [ Search | Check update time | Archives: 1 ]

[ Next Thread | Previous Thread | Next Message | Previous Message ]

Date Posted: 07:34:28 04/25/02 Thu
Author: Chris
Subject: Re: *sniff* [CC'ed to the Noct Cabal]
In reply to: Chris 's message, "Re: *sniff* [CC'ed to the Noct Cabal]" on 12:22:17 04/24/02 Wed

>I'm glad, really like solving problems. I just wanted
>to make sure that I wasn't invading your privacy. I
>would want someone to ask before they took a sample of
>my blood for instance. We will think about this and
>we should have some tests in 24 hours or so.

Hey Eduna, Jess and I did some thinking on this last night and decided we don't know enough basically. We are doing some research, including talking to a friend of ours who did his thesis on quantum computing. For now, here are some conclusions we've come to thought.

Quantum computing is more powerful than proving P=NP. In other words, there are problems that you can't solve with P=NP that you can still solve with a quantum computer and there are no problems you can solve with P=NP that you can't solve with a quantum computer. Basically such problems would be ones that require exponential time both to solve and to check a solution for, at least that's my understanding. I'm not really sure what such problems are, which is why I'm checking with James.

--Chris

[ Next Thread | Previous Thread | Next Message | Previous Message ]