[{"n": "Abstract machine", "u": "/e/mathematical-logic-and-computation/abstract-machine/", "s": "Theoretical model for analyzing computer system functions."}, {"n": "Algorithm", "u": "/e/mathematical-logic-and-computation/algorithm/", "s": "A finite sequence of logical instructions for solving problems."}, {"n": "Analysis of algorithms", "u": "/e/mathematical-logic-and-computation/analysis-of-algorithms/", "s": "Study of resource usage in algorithm execution."}, {"n": "Successive over-relaxation", "u": "/e/mathematical-logic-and-computation/successive-over-relaxation/", "s": "A variant of Gauss–Seidel for faster convergence."}, {"n": "Turing machine", "u": "/e/mathematical-logic-and-computation/turing-machine/", "s": "Abstract machine model that can implement any computer algorithm."}, {"n": "Universal Turing machine", "u": "/e/mathematical-logic-and-computation/universal-turing-machine/", "s": "A Turing machine that can simulate any other Turing machine."}, {"n": "Turing's proof", "u": "/e/mathematical-logic-and-computation/turing-s-proof/", "s": "Proof that some mathematical questions cannot be answered by computation."}, {"n": "Turing degree", "u": "/e/mathematical-logic-and-computation/turing-degree/", "s": "Measures the level of algorithmic unsolvability of a set."}, {"n": "Turing reduction", "u": "/e/mathematical-logic-and-computation/turing-reduction/", "s": "A reduction using an oracle machine to decide one problem via another."}, {"n": "Viterbi algorithm", "u": "/e/mathematical-logic-and-computation/viterbi-algorithm/", "s": "Dynamic programming algorithm for finding most likely hidden state sequences."}, {"n": "Abstract data type", "u": "/e/mathematical-logic-and-computation/abstract-data-type/", "s": "A mathematical model for data types defined by behavior."}, {"n": "Adjacency matrix", "u": "/e/mathematical-logic-and-computation/adjacency-matrix/", "s": "Square matrix encoding vertex adjacency in a graph."}, {"n": "Automata theory", "u": "/e/mathematical-logic-and-computation/automata-theory/", "s": "Study of abstract machines and solvable computational problems."}, {"n": "Computability theory", "u": "/e/mathematical-logic-and-computation/computability-theory/", "s": "Study of computable functions and degrees of noncomputability."}, {"n": "Decidability (logic)", "u": "/e/mathematical-logic-and-computation/decidability-logic/", "s": "Decidability concerns effective methods for logical membership."}, {"n": "Halting problem", "u": "/e/mathematical-logic-and-computation/halting-problem/", "s": "No algorithm can decide if any program halts."}, {"n": "NP-completeness", "u": "/e/mathematical-logic-and-computation/np-completeness/", "s": "Hardest problems in NP, central to P versus NP."}, {"n": "P versus NP", "u": "/e/mathematical-logic-and-computation/p-versus-np/", "s": "Can every quickly verified problem be quickly solved?"}, {"n": "Boolean algebra", "u": "/e/mathematical-logic-and-computation/boolean-algebra/", "s": "Algebra of truth values and logical operations."}, {"n": "Truth table", "u": "/e/mathematical-logic-and-computation/truth-table/", "s": "A tabular method for evaluating logical expressions."}]