User:Code monk 9999/Books/turing
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Automata
[edit]Turing
[edit]- Secret sharing
- Information-theoretic security
- Information theory
- Shamir's Secret Sharing
- Hyperplane
- Parallel (geometry)
- Secret sharing using the Chinese remainder theorem
- Chinese remainder theorem
- Coprime integers
- Proactive secret sharing
- Verifiable secret sharing
- All-or-nothing transform
- Wireless sensor network
- Vanish (computer science)
- Homomorphic secret sharing
- Byzantine fault tolerance
- Access structure
- Erasure code
- Secure multi-party computation
- Visual cryptography
- Tontine
- Orthogonal array
- Nondeterministic finite automaton
- Automata theory
- Finite-state machine
- Deterministic finite automaton
- Regular language
- Formal language
- Powerset construction
- Regular expression
- Thompson's construction
- State diagram
- State transition table
- Closure (mathematics)
- Binary operation
- Unary operation
- Kleene star
- Set (mathematics)
- Operation (mathematics)
- Transition system
- State machine replication
- Model of computation
- Abstract machine
- State (computer science)
- Turing machine
- Computability
- Entscheidungsproblem
- Recursively enumerable set
- Automaton
- Alphabet (formal languages)
- Black box
- Halting problem
- Unrestricted grammar
- Lambda calculus
- Universal Turing machine
- Church–Turing thesis
- Effective method
- Computational complexity theory
- Von Neumann architecture
- Stored-program computer
- Computable function
- Partial function
- Recursively enumerable language
- Recursion (computer science)
- Recursive language
- Undecidable problem
- Rice's theorem
- Turing completeness
- Cellular automaton
- Computability theory
- Instruction set
- Imperative programming
- Branch (computer science)
- One instruction set computer
- Linear bounded automaton
- Alternating Turing machine
- Turing machine examples
- Turing machine equivalents
- Multi-track Turing machine
- Multitape Turing machine
- Probabilistic Turing machine
- Read-only right moving Turing machines
- Read-only Turing machine
- Unambiguous Turing machine
- Non-deterministic Turing machine
- Quantum Turing machine
- True quantified Boolean formula
- Boolean satisfiability problem
- Complexity class
- P (complexity)
- PSPACE
- EXPTIME
- Circuit minimization for Boolean functions
- Boolean function
- Polynomial hierarchy
- LH (complexity)
- Discrete uniform distribution
- Stochastic
- Interactive proof system
- Randomized algorithm
- BPL (complexity)
- RL (complexity)
- NL (complexity)
- BPP (complexity)
- ZPP (complexity)
- RP (complexity)
- UP (complexity)
- NP (complexity)
- Stochastic matrix
- Quantum finite automata
- Quantum state
- Unitary matrix
- Tuple
- Hilbert space
- Automorphism
- Semiautomaton
- Isomorphism
- Mathematical object
- Symmetry
- Symmetry group
- Group (mathematics)
- Category theory
- Morphism
- Endomorphism
- Abstract algebra
- Algebraic structure
- Ring (mathematics)
- Vector space
- Bijection
- Group homomorphism
- Ring homomorphism
- Linear map
- Identity function
- Associative property
- Identity element
- Inverse element
- Function composition
- Class (set theory)
- Permutation
- Symmetric group
- Abelian group
- Inner automorphism
- Kernel (algebra)
- Center (group theory)
- Set theory
- Zermelo–Fraenkel set theory
- Axiomatic system
- Naive set theory
- Paradoxes of set theory
- Axiom of choice
- Foundations of mathematics
- Large cardinal
- Real number
- Consistency
- Antinomy
- Cardinal number
- The Principles of Mathematics
- Union (set theory)
- Intersection (set theory)
- Complement (set theory)
- Symmetric difference
- Cartesian product
- Power set
- Von Neumann universe
- Cumulative hierarchy
- Transfinite induction
- Ordinal number
- Infimum and supremum
- Successor ordinal
- Zermelo set theory
- General set theory
- Axiom schema of replacement
- Axiom schema of specification
- Burali-Forti paradox
- Russell's paradox
- Von Neumann–Bernays–Gödel set theory
- Fuzzy set
- Intuitionistic logic
- Classical logic
- Constructive set theory
- Mathematical logic
- Constructive proof
- Propositional formula
- Truth value
- Theorem
- Theory of justification
- Inhabited set
- Curry–Howard correspondence
- Law of excluded middle
- Double negation
- Algebraic semantics (mathematical logic)
- Constructivism (mathematics)
- Disjunction and existence properties
- Four color theorem
- Logical equivalence
- Boolean algebra
- Kripke semantics
- Heyting algebra
- Brouwer–Hilbert controversy
- Uncountable set
- Infinite tree automaton
- Tree automaton
- Countable set
- Pushdown automaton
- Deterministic automaton
- Alternating finite automaton
- Omega language
- Omega-regular language
- Context-sensitive language
- Context-free language
- Deterministic context-free language
- Muller automaton
- Ω-automaton
- Büchi automaton
- Deterministic pushdown automaton