Mathematical Logic And Computation 1-21
20 entries in the Mathematical Logic And Computation compendium.
Abstract machineTheoretical model for analyzing computer system functions.AlgorithmA finite sequence of logical instructions for solving problems.Analysis of algorithmsStudy of resource usage in algorithm execution.Successive over-relaxationA variant of Gauss–Seidel for faster convergence.Turing machineAbstract machine model that can implement any computer algorithm.Universal Turing machineA Turing machine that can simulate any other Turing machine.Turing's proofProof that some mathematical questions cannot be answered by computation.Turing degreeMeasures the level of algorithmic unsolvability of a set.Turing reductionA reduction using an oracle machine to decide one problem via another.Viterbi algorithmDynamic programming algorithm for finding most likely hidden state sequences.Abstract data typeA mathematical model for data types defined by behavior.Adjacency matrixSquare matrix encoding vertex adjacency in a graph.Automata theoryStudy of abstract machines and solvable computational problems.Computability theoryStudy of computable functions and degrees of noncomputability.Decidability (logic)Decidability concerns effective methods for logical membership.Halting problemNo algorithm can decide if any program halts.NP-completenessHardest problems in NP, central to P versus NP.P versus NPCan every quickly verified problem be quickly solved?Boolean algebraAlgebra of truth values and logical operations.Truth tableA tabular method for evaluating logical expressions.
Browse Mathematical Logic And Computation 1-21 in the interactive codex →