Algorithm and decision procedure
An algorithm specifies effective steps; a decision procedure must terminate on every permitted input.
Key knowledge
An algorithm specifies computable steps for obtaining a result. A decision procedure for a yes-or-no problem must return the correct answer and terminate for every input in its declared domain.
Conditions and scope
- Specify input representation, permitted operations and the required result.
- A procedure that may run forever on some inputs is not a total decision procedure for that problem.
Sources · 4
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Effective steps and total decision-procedure requirements.
2026-10-10 · Compared the dictionary definition with Cambridge's decision-problem specification.
Foundational review
2026-10-10 · Fresh primary-source inspection of the complete compact record, including every statement, equation, quantity and material condition, followed by independent AI editorial review. This check does not certify all linked lessons or every passage of every cited publication.
Sources from other places
Scope or convention differs
A computational method maps declared inputs to outputs, illustrated by a finite-list procedure.
This practical course does not independently formalise every total decision-procedure condition.
University of Helsinki, Department of Computer Science
- Data Structures and Algorithms · Introduction FinlandEnglish
What is an algorithm?; Implementing an algorithm
- Data Structures and Algorithms · Introduction
Entry details
Permanent link to this entry ↗- Record identity
- info-algorithms
- Revision
- core.1
- Structured reference record
- Essential core · first collection