Computability theory

Aucun article

Turing machine Halting problem Recursive function Degrees of unsolvability Computability Oracle machine Turing degree Turing jump Turing computability Busy beaver Decision problem Undecidable problem Decidable set Decidable language Recursive set Computable set Recursive language Recursively enumerable set Computably enumerable set Recursively enumerable language Computable function General recursive function Partial function Primitive recursive function Primitive recursive set function Mu operator Ackermann function Course of values recursion Double recursion Kleenes recursion theorem Kleenes t predicate Kleene equality Smn theorem Utm theorem Rices theorem Recursion Recursion computer science Churchturing thesis Churchturingdeutsch principle History of the churchturing thesis Effective method Effective enumeration Enumeration Enumeration reducibility Reduction recursion theory Medvedev reducibility Computably inseparable Simple set Maximal set computability theory Creative and productive sets K trivial set Low computability High computability Low basis theorem Basis theorem computability Pa degree Pi01 class Posts theorem Post correspondence problem Friedbergmuchnik theorem Friedberg numbering Numbering computability theory Admissible numbering Complete numbering Index set computability Arithmetical hierarchy Hyperarithmetical theory Hyperarithmetic set Kleene hierarchy Arithmetical set Diophantine set Word problem for groups Hypercomputation Model of computation Markov algorithm Random access turing machine Alpha recursion theory Subrecursion theory Forcing computability Limits of computation Computable analysis Computable number Computable measure theory Mccarthy formalism Elementary recursive function Tarskikuratowski algorithm Chain rule for kolmogorov complexity Lempelziv complexity Incompressibility method Algorithm characterizations Admissible set Effective results in number theory Description number Semicomputable function Computation Tarski kuratowski algorithm Alternating turing machine Probabilistic turing machine Symmetric turing machine Transcomputational problem Bremermanns limit Church turing thesis Church turing deutsch principle Computation history Cylindric numbering Entscheidungsproblem Godel numbering Mutual recursion Reachability analysis Reachability problem Self reference Simply typed lambda calculus Sudan function Tail recursion Turing completeness Turing machine equivalents Turing tarpit Turings proof Typed lambda calculus Subclass reachability 01 class Akra bazzi method Alan turing Alonzo church Analytical hierarchy Anamorphism Andrzej grzegorczyk Anonymous function Anonymous recursion Apomorphism Applicative computing systems Approximation preserving reduction Arms length recursion Automatic group Automatic semigroup B c k w system B hm tree Bar recursion Basis theorem Beta normal form Binary combinatory logic Calculus of constructions Call by push value Cartesian closed category Catamorphism Chicken or the egg Church encoding Church rosser theorem Circuit satisfiability problem Combinatory categorial grammar Combinatory logic Computability in analysis and physics Computability logic Computable isomorphism Computable ordinal Computable real function Constant recursive sequence Control flow Conversion Corecursion Counting problem Craigs theorem Currying De bruijn index De bruijn notation Difference equations from rabbits to chaos Direct recursion Director string Divergence Droste effect Effective descriptive set theory Effective dimension Effective polish space Emil leon post Enumerator Explicit substitution Fine grained reduction Fixed point combinator Fold Function application G bels sequence G del numbering for sequences Gadget Generative recursion Gestalt pattern matching Gijswijts sequence Grzegorczyk hierarchy Hierarchical and recursive queries in sql High Higher order function Hindley milner type system History of the church turing thesis Hylomorphism Impredicativity Index set Indirect recursion Infinite loop Infinite regress Initial condition Integrodifference equation Intersection type discipline Iota and jot Jacobi operator Jacobsthal number Jeffrey b remmel Johanna n y franklin Juggler sequence K nigs lemma K regular sequence Keith number Kleene rosser paradox Knights of the lambda calculus Krivine machine L reduction Lambda calculus definition Lambda cube Lambda lifting Left recursion Lempel ziv complexity Leonardo number Let expression Lightface analytic game Linear recurrence with constant coefficients Log space reduction Loop Louise hay Low Lucas number Lucas sequence M nage problem Malament hogarth spacetime Many one reduction Martin measure Master theorem Mathematical universe hypothesis Matrix difference equation Matryoshka doll Maximal set Mccarthy 91 function Melvin fitting Metamorphism Modulus of convergence Mogensen scott encoding Montague grammar Mu nik reducibility Multiple recursion Myhill isomorphism theorem Noetherian recursion Nonrecursive filter Normal form Normalisation by evaluation Numbering Open recursion Padovan sequence Paramorphism Parsimonious reduction Pattern calculus Pell number Perrin number Polymorphic recursion Polynomial time counting reduction Polynomial time reduction Primefree sequence Ptas reduction R zsa p ter Rational difference equation Real computation Recam ns sequence Recurrence relation Recursive acronym Recursive islands and lakes Reduction Reduction strategy Reentrancy S2s Scott curry theorem Second order cybernetics Single recursion Ski combinator calculus Skolem mahler lech theorem Skolem problem Somos sequence Specker sequence Stephen cole kleene Super recursive algorithm Supercombinator Supertask Suslin kleene theorem Sylvesters sequence System f Tail call Time scale calculus To mock a mockingbird Tree traversal Truth table reduction Turing reduction Turtles all the way down Type inhabitation Untyped lambda calculus Walther recursion Weihrauch reducibility Well founded recursion When fiction lives in fiction Wilhelm ackermann William craig William gasarch Zeno machine A priori and a posteriori bounds in matrix computations Algebraic decidability of local classification problems Algorithm computational complexity of an Average case computational complexity Binary computing system Closure of a computational algorithm Computable invariant Computable real number Computational algorithm Computational complexity classes Computer abstract Computer algebra package Decidable formula Decidable predicate Decimal computation system Degree of undecidability Essentially undecidable theory General recursive operator Mathematical theory of computation Natural selection in search and computation Nondeterministic turing machine Optimization of a computational method Optimization of computational algorithms Partial recursive function Partial recursive operator Primitive recursion Quantum computation theory of Quantum turing machine Recursions of higher degrees Recursive equivalence type Recursive estimation Recursive game Recursive operator Recursive predicate Recursive realizability Recursive relation Recursive sequence Reliable computation Stability of a computational algorithm Stability of a computational process Turing reducibility Undecidability Universal turing machine

Pas encore d'articles dans cette catégorie — ça arrive.