10 Algorithm Classes

🔄 Algorithm Loop Classes

Seven classes that categorize all algorithms by their verb chain pattern.
Each algorithm is a named verb chain that can be instantiated with concrete types.

_{See also: Architectural Principles · PAG Keywords}

---

· 📊 Classification Table

Class	Verb Pattern	Use When
Perceptual Loop	FIND → ANALYZE → WRITE/CREATE	Signal detection and response
Cognitive Loop	READ → FIND → LINK → CREATE	Information processing and integration
Decision Loop	CREATE → FIND → FILTER → EXECUTE	Option evaluation and selection
Construction Loop	EXTRACT → CREATE → ANALYZE → WRITE	Component assembly and validation
Adaptive Loop	READ → ANALYZE → EXECUTE → ITERATE	Environment sensing and adjustment
Meta Loop	FIND → ANALYZE → EXECUTE → ITERATE	Self-monitoring and optimization
Hypothesis-Validation Loop	CREATE → ANALYZE → ANALYZE → EXECUTE	Hypothesis testing and refinement

---

· 📦 Algorithm Inventory

· 🏛️ Theoretical Foundations (1960s-1980s)

Algorithm	Class	Verb Chain
McCulloch-Pitts-Threshold-Logic	Perceptual	READ → ANALYZE → EXECUTE → ANALYZE → CREATE → ITERATE
ELIZA-Pattern-Matching	Perceptual	READ → FIND → FIND → EXECUTE → CREATE → ITERATE
AARON-Generative-Art	Construction	CREATE → EXECUTE → ANALYZE → EXECUTE → ITERATE
Means-Ends-Analysis	Cognitive	READ → FIND → FIND → ANALYZE → EXECUTE → ITERATE
Production-System-Cycle	Adaptive	READ → FIND → FILTER → EXECUTE → WRITE → ITERATE
SOAR-Problem-Space-Search	Cognitive	READ → CREATE → FIND → ANALYZE → EXECUTE → FIND → CREATE → ITERATE
STRIPS-Planning	Construction	READ → READ → FIND → FIND → ANALYZE → EXECUTE → WRITE → ITERATE
Frame-Based-Reasoning	Cognitive	READ → FIND → EXTRACT → ANALYZE → SET → LINK → ITERATE
Resolution-Unification	Hypothesis-Validation	READ → FIND → EXECUTE → CREATE → ANALYZE → ITERATE
Dependency-Directed-Backtracking	Hypothesis-Validation	READ → CREATE → EXECUTE → FIND → ANALYZE → EXECUTE → ITERATE
Backward-Chaining-Inference	Decision	READ → FIND → ANALYZE → EXECUTE → CREATE → SET → ITERATE
Marr-Three-Level-Analysis	Meta	ANALYZE → CREATE → CREATE → CREATE → ANALYZE → ITERATE

· ⚙️ Development Rules Algorithms

Algorithm	Class	Primary Principles
Module-Separation-Protocol	Meta	SOC, SRP
Extension-Without-Modification-Protocol	Decision	OCP
Dependency-Inversion-Protocol	Construction	DIP, ISP
State-Snapshot-Recovery-Protocol	Construction	Immutability, Idempotency
Intention-Emission-Protocol	Perceptual	DCB/CF, Event-driven
Security-Inheritance-Protocol	Hypothesis-Validation	Encapsulation, Fail Fast
Human-Authority-Protocol	Decision	Human-in-Loop
Complexity-Boundary-Protocol	Meta	Bounded Complexity
Registry-Resolution-Protocol	Cognitive	Centralized, ISP
Verification-Gate-Protocol	Hypothesis-Validation	Fail Fast

· 🔬 Hypothesis-Validation Algorithms

Algorithm	Verb Chain
Hypothesis-Validation-Loop	CREATE → FIND → EXECUTE → ANALYZE → ANALYZE → ITERATE
Recursive-Verification-Loop	READ → CREATE → EXECUTE → ANALYZE → FIND → CREATE → EXECUTE → ANALYZE → ITERATE
Evidence-Based-Hypothesis-Refinement	READ → ANALYZE → CREATE → FILTER → ANALYZE → CREATE → EXECUTE → ANALYZE → SET → ITERATE
Dual-Analysis-Verification	EXECUTE → EXECUTE → COMPARE → FIND → ANALYZE → CREATE → ITERATE
Assertion-Verification-Loop	READ → CREATE → EXECUTE → ANALYZE → FIND → CREATE → ITERATE
Multi-Gate-Debugging	ANALYZE → INVESTIGATE → DETERMINE → CREATE → DETERMINE → EXECUTE → ANALYZE → FIND → ITERATE

---

· 🔧 Integration Protocol

How to select and instantiate an algorithm:

1. FIND<Loop-Pattern>    — Match task to algorithm class using classification table
2. EXTRACT<Type-Params>  — Extract domain objects from task into type placeholders
3. SET<Preposition-Slots> — Map concrete values to preposition operators (FROM, INTO, USING)
4. CREATE<Directive-Block> — Instantiate the algorithm with concrete types into PAG directives

· 🧠 Universal Problem-Solving Chain

Applies across all domains:

INTAKE → ABSTRACT → DEFINE → CONSTRAIN → EXPLORE → PREDICT → CHOOSE → EXECUTE → VALIDATE → REFINE

Step	What it does
INTAKE	Read the current state
ABSTRACT	Build a representation
DEFINE	Specify the target output
CONSTRAIN	Set domain bounds
EXPLORE	Generate candidate solutions
PREDICT	Evaluate branches
CHOOSE	Select the path
EXECUTE	Apply the operation
VALIDATE	Verify the output
REFINE	Adjust strategy and iterate

---

Source: Algorithm definitions in .claude/_meta-intel/