Linked from

The 48 pages that link to Algorithm, each with the reason it gives.

• Artificial intelligenceNarrower topic: AI methods are algorithms implemented to transform inputs into decisions or outputs.

• Turing machineNarrower topic: Turing machines give a formal model for algorithmic procedures.

• Halting problemNarrower topic: The impossibility concerns every possible algorithm, not merely a particular implementation.

• Church–Turing thesisNarrower topic: Algorithms supply the informal procedures whose scope the thesis characterizes.

• Computability theoryNarrower topic: Computability theory formalizes which problems algorithms can solve.

• Breadth-first searchNarrower topic: Breadth-first search is a precise procedure for systematic graph exploration.

• BioinformaticsNarrower topic: Bioinformatics turns biological tasks into procedures that computers can execute.

• Time complexityNarrower topic: Time complexity is a property assigned to an algorithm’s execution.

• Computer simulationNarrower topic: A simulation is implemented as algorithms that update model state and produce outputs.

• Scientific computingNarrower topic: Algorithms specify the procedures that transform models and data into results.

• Computable functionNarrower topic: A computable function is one whose outputs an algorithm can produce on every input.

• DecidabilityNarrower topic: Decidability asks whether an algorithm solves every instance of a decision problem.

• Universal Turing machineNarrower topic: The universal machine formalizes executing algorithms from their encoded descriptions.

• Deterministic algorithmNarrower topic: Deterministic algorithms are a major class of algorithms, distinguished by fixed choices at each step.

• Hilbert's tenth problemNarrower topic: The problem asks whether one algorithm can decide every polynomial equation's integer solvability.

• Data scienceNarrower topic: Data science relies on algorithms to transform data and fit models.

• Computable setNarrower topic: A computable set has an algorithm that always returns a membership answer.

• Computational biologyNarrower topic: Algorithms are the formal procedures at the heart of computational analyses.

• Theoretical computer scienceNarrower topic: Algorithms are the objects whose correctness and resource use are analyzed.

• Computably enumerable setNarrower topic: An effective listing must be produced by such a procedure.

• Theory of computationNarrower topic: The theory formalizes algorithms to study their limits and resource costs.

• History of computer scienceNarrower topic: The idea of stepwise procedures connects ancient mathematics to modern computation.

• Niklaus WirthNarrower topic: Wirth’s language designs were closely tied to expressing algorithms clearly.

• Richard M. KarpNarrower topic: Karp’s career centered on designing, analyzing, and classifying algorithms.

• Turing's proofNarrower topic: The proof rules out any algorithm that decides halting in every case.