computation

3 articles · All tags

• Gödel's Incompleteness Theorems: What They Prove
  Gödel's incompleteness theorems show that no consistent formal system for basic arithmetic can prove every truth about numbers, or prove its own consistency.
• P vs NP
  P vs NP explained: why verifying solutions is easy but finding them may be hard, what polynomial time means, and why this Millennium Prize problem matters.
• Quantum Computing
  What a quantum computer actually is — qubits, superposition, entanglement, and interference — and which problems it will and will not revolutionize.