The following pages link to Turing machine
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Formal language (links | edit)
- First-order logic (links | edit)
- Finite set (links | edit)
- Gamma (links | edit)
- Gödel's completeness theorem (links | edit)
- History of computing hardware (links | edit)
- Instruction register (links | edit)
- Integrated circuit (links | edit)
- Itanium (links | edit)
- Knapsack problem (links | edit)
- Law of noncontradiction (links | edit)
- Law of excluded middle (links | edit)
- Logical conjunction (links | edit)
- Logical connective (links | edit)
- Propositional calculus (links | edit)
- Lambda calculus (links | edit)
- Lossless compression (links | edit)
- Lemma (mathematics) (links | edit)
- Mathematical induction (links | edit)
- Finitary relation (links | edit)
- Microprocessor (links | edit)
- Mathematical logic (links | edit)
- Model theory (links | edit)
- Microcode (links | edit)
- Microassembler (links | edit)
- MIPS architecture (links | edit)
- Instructions per second (links | edit)
- Class (set theory) (links | edit)
- Microcontroller (links | edit)
- Number theory (links | edit)
- NP (complexity) (transclusion) (links | edit)
- Number (links | edit)
- Nondeterministic Turing machine (links | edit)
- Ordered pair (links | edit)
- Oracle machine (links | edit)
- Power set (links | edit)
- Principia Mathematica (links | edit)
- PowerPC (links | edit)
- Pushdown automaton (links | edit)
- Primitive recursive function (links | edit)
- PA-RISC (links | edit)
- Peano axioms (links | edit)
- Quantum computing (links | edit)
- Quantum information (links | edit)
- Recursion (links | edit)
- Proof by contradiction (links | edit)
- Regular expression (links | edit)
- Regular language (links | edit)
- Regular grammar (links | edit)
- Roger Penrose (links | edit)