[citation needed]

[lol]

Fusors are a standard neutron source, and they're fairly straightforward to build.

The idea that you could throw hydrogen ions at each other with enough energy to fuse is fairly obvious. It turns out that the obvious ways of doing so are orders of magnitude short of generating net power, but they do generate neutrons.

You must be new here.

Right, I've been duped into looking at the prices of things people actually buy, rather than their more expensive 1990 equivalents.

This is a standard definition of "regret" in an economics context.

No.

You can't use separated entangled qubits to send information faster than light. It doesn't work that way. There are a bunch of tricks and operations you can do, but none of them result in the other end being able to distinguish a change of state.

Eliminating arbitrary differences in regulation is stupid?

The downside is it removes an incentive to patent (or publish) rather than keep something as a trade secret.

And also note that you don't need to be able to reduce SAT to a problem for it to be hard!

Factoring is almost certainly easier than SAT but harder than anything in P.

I think no such thing, and neither do they.

Remember how my first response in this thread was that you had your definitions backwards? I'm saying factoring is NP-easy. Nobody who actually knows what they're talking about thinks its NP-hard.

A problem doesn't need to be hard to reduce it to SAT.

You can use a 3-sat solver on any problem in NP. It doesn't have to be NP complete.

An instance of "does N have a nontrivial factor smaller than m?" *trivially* turns into a circuit. The circuit is just a bunch of multipliers and an OR gate!

Next up, a circuit trivially turns into a boolean formula. I hope I don't need to spell out the equivalence.

Third, they take the resulting formula and plug it into the reduction from SAT to 3-SAT.

Fourth they plug said formula into their solver.

Take above steps, but replace reductions depending on exactly which problem the solver solves.

That's great. The fact you can use a solver for any problem in NP-complete to solve any problem in NP is even more obvious. It's why NP collapses to P if NP-complete is in P!

Security by obscurity, eh? Luckily, it's not a problem for a constructive proof that P=NP, since the reductions are all known.

You've got it backwards. A problem being NP-complete means you can reduce any problem in NP to it.

The problem "does N have a nontrivial factor smaller than m?" is in NP. A solver for that can easily be used to factor integers.

Technically speaking, a legitimate proof that P=NP implies that every problem in P is NP complete.

What we're talking about is not proofs but rather unproven algorithms which seem to scale because they aren't run on hard inputs.

The proof is that there is no proof.

This is one of those extraordinary-claims-require-extraordinary-evidence cases. "I tried random inputs" is not good enough. To take it seriously, those random inputs should correspond to hard problems -- for example, use this supposed 3-SAT solver on reductions from integer factoring to factor an RSA number.

Customizability.

The causality violations aren't local. Everything is causal to you in your warp bubble but in the reference frame of a sufficiently fast moving observer you still arrive before you leave.