Articles I've created: Addition Big O BPP BQP Cellular automaton Clay Mathematics Institute Complexity theory Computability theory Computational complexity theory Co-NP Co-NP-complete Counter Edge EXPTIME EXPTIME-complete EXPSPACE Integer factorization Millennium Prize Problems NC Necker cube Newcomb's paradox NP (complexity) NP-complete NP-easy NP-equivalent NP-hard Omnipotence paradox Oracle machine P-complete Prim's algorithm PSPACE PSPACE-Complete Quantum computer Raven paradox Recursively enumerable language RP (complexity) #P #P-Complete Subset sum problem Ulam spiral Undecidable language Unexpected hanging paradox Wang tile ZPP AI-complete (since August 2001)
My favorite pages: Computability theory Computational complexity theory David Hilbert List of algorithms Paradox Quantum computer
Pages to which I've contributed significantly: Ansible Binary tree Blum Blum Shub Bohm interpretation Boolean satisfiability problem Burrows-Wheeler transform Byte Chomsky hierarchy Completeness Complexity classes P and NP Computation Context-sensitive language Conway's Game of Life David Hilbert Decision problem Discrete math Distance Formal grammar Formal language Gödel's incompleteness theorem Grammar Great circle Grovers algorithm Halting problem Horner scheme Infinity Interpretation of quantum mechanics Klein bottle Kruskal's algorithm Knapsack problem
Law of non-contradiction Law of the excluded middle Language List of algorithms Minesweeper Minimum spanning tree Mnemonic major system Mutual recursion Noble gas NP-Hard O One-time pad P Pangram Peano axioms Penrose tiling Prime number Principle of bivalence Prisoners dilemma Pseudorandom number generator Quantum leap Quasicrystal RC4 Roger Penrose RSA Surreal number Tiling Time travel Turing machine Turing test
Category: Wikipedians who are not currently active