# Algorithm ## Built MicroSim Articles — live (three.js) **147 ALGORITHM microsims are built and live** on `wikitube-3d-microsims.netlify.app`, each paired with a microsim-first article: **126 new** at this hub root, **21 promoted** into the Collision folder. Full index: ALGORITHM MicroSim Articles. ## Links (Wikipedia order) <!-- injected from _registry/childlinks/Algorithm.json (2026-07-30T02:09:12Z) --> `ALGOL` · `Abstract_machine` · `Ada_Lovelace` · `Adelard_of_Bath` · `Al-Khwarizmi` · `Al-Kindi` · `Alan_Turing` · `Alan_Turing:_The_Enigma` · `Algebra_of_physical_space` · `Algebraic_structure` · `Algorism` · `Algorithm_(disambiguation)` · `Algorithm_aversion` · `Algorithm_characterizations` · `Algorithm_engineering` · `Algorithmic_bias` · `Algorithmic_composition` · [[Algorithmic_efficiency]] · `Algorithmic_entities` · `Algorithmic_paradigm` · `Algorithmic_technique` · `Alonzo_Church` · `AlphaDev` · `AlphaEvolve` · `AlphaTensor` · `AlphaZero` · `Analysis_of_algorithms` · `Analytical_engine` · `Analytical_mechanics` · `Ancrene_Wisse` · `Andreas_Blass` · `Andrew_Hodges` · `Applied_mathematics` · `Approximation_algorithm` · `Approximation_theory` · `Arithmetic` · `Array_(data_structure)` · `Arthur_Zimek` · [[Artificial_intelligence]] · `Asger_Aaboe` · `Assignment_(computer_science)` · `Association_for_Computing_Machinery` · `Associative_array` · `Automata_theory` · `Automated_decision-making` · `Automated_reasoning` · `Automated_theorem_proving` · `Babylonia` · `Babylonian_astronomy` · `Babylonian_mathematics` · `Backtracking` · `Baghdad` · `Baudot_code` · `Benchmark_(computing)` · `Best,_worst_and_average_case` · `Big_O_notation` · `Binary_search` · `Binary_search_tree` · `Bosonic_string_theory` · `Branch_and_bound` · `Breadth-first_search` · `Brute-force_search` · `Brāhmasphuṭasiddhānta` · `C++` · `Calculation` · `Calculator` · [[Calculus_of_variations]] · [[Chaos_theory]] · `Charles_Babbage` · `Chess` · `Chinese_mathematics` · `Church–Turing_thesis` · `Classical_field_theory` · [[Claude_Shannon]] · `Clifford_algebra` · `Clifford_analysis` · `Coding_theory` · `Combinatorics` · `Communications_of_the_ACM` · `Computability_theory` · `Computation` · `Computational_complexity_theory` · `Computational_geometry` · `Computational_group_theory` · `Computational_mathematics` · `Computational_number_theory` · `Computational_problem` · `Computational_statistics` · `Computer_algebra` · `Computer_program` · [[Computer_science]] · `Conditional_(computer_programming)` · `Conformal_field_theory` · `Constraint_programming` · `Constraint_satisfaction_problem` · `Control_table` · [[Control_theory]] · `Convex_polytope` · `Cookbook` · `Copyright_status_of_works_by_the_federal_government_of_the_United_States` · `Cryptanalysis` · `Cryptography` · `DRAKON` · `Daniel_Dennett` · [[Data_compression]] · `Data_processing` · `Data_structure` · `David_Hilbert` · [[Decision_theory]] · `Depth-first_search` · `Determinism` · `Deterministic_algorithm` · `Diamond_v._Diehr` · `Difference_engine` · [[Differential_equation]] · `Differential_form` · `Differential_geometry` · `Discrete_geometry` · `Discrete_mathematics` · `Distributed_algorithm` · `Divide-and-conquer_algorithm` · `Division_algorithm` · `Donald_Knuth` · [[Dynamic_programming]] · [[Dynamical_system]] · `Effective_field_theory` · `Effective_method` · `Empirical_algorithmics` · `Encryption` · `Encyclopedia_of_Mathematics` · `Entscheidungsproblem` · `Eric_W._Weisstein` · `Euclid's_Elements` · `Euclidean_algorithm` · [[Evolutionary_computation]] · `Export_of_cryptography` · `Exterior_algebra` · [[Fast_Fourier_transform]] · [[Feedback]] · `Fenwick_tree` · [[Finite-state_machine]] · `Flowchart` · `Floyd–Warshall_algorithm` · `Fold_(higher-order_function)` · `Formal_language` · [[Fourier_analysis]] · `Frequency_analysis` · `Function_(mathematics)` · [[Functional_analysis]] · `Functional_integration` · `Functional_programming` · [[Game_theory]] · `Garbage_in,_garbage_out` · `Gauge_theory` · `Gauge_theory_(mathematics)` · [[Genetic_algorithm]] · `Geoffrey_Chaucer` · `Geometric_algebra` · `Geometric_analysis` · `Geometric_calculus` · `Georg_Cantor` · [[George_Boole]] · `George_Boolos` · `George_Stibitz` · `Google_DeepMind` · `Gottlob_Frege` · `Gottschalk_v._Benson` · `Government_by_algorithm` · `Graph_(abstract_data_type)` · `Graph_(discrete_mathematics)` · [[Graph_theory]] · `Graph_traversal` · `Greatest_common_divisor` · `Greedy_algorithm` · `Hamiltonian_mechanics` · `Hans-Peter_Kriegel` · `Hash_function` · `Hash_table` · `Heap_(data_structure)` · `Heuristic_(computer_science)` · `Hindu–Arabic_numeral_system` · `Huffman_coding` · `Indian_mathematics` · `Inference` · [[Information_theory]] · `Instagram` · `Integer` · `Integer_programming` · `International_Council_for_Industrial_and_Applied_Mathematics` · `Introduction_to_Algorithms` · `Iteration` · `J._Barkley_Rosser` · `Jacques_Herbrand` · `Japan_Society_for_Industrial_and_Applied_Mathematics` · `Jean_van_Heijenoort` · `John_of_Seville` · [[John_von_Neumann]] · `Judith_Grabiner` · `Kerala_school_of_astronomy_and_mathematics` · `Knapsack_problem` · `Kruskal's_algorithm` · `Kurt_Gödel` · `LLVM` · `Lagrangian_mechanics` · `Lambda_calculus` · `Large_language_model` · `Las_Vegas_algorithm` · `Latinisation_of_names` · `Linear_programming` · `Linked_list` · `List_of_algorithm_general_topics` · `List_of_algorithms` · `List_of_arbitrary-precision_arithmetic_software` · `List_of_artificial_intelligence_algorithms` · `List_of_computer_books` · `List_of_data_structures` · `List_of_finite_element_software_packages` · `List_of_interactive_geometry_software` · `List_of_numerical-analysis_software` · [[List_of_numerical_libraries]] · `List_of_optimization_software` · `List_of_statistical_software` · `Local_search_(optimization)` · `Logic_in_computer_science` · `Logic_programming` · `Lookup_table` · `Machine_code` · `Malliavin_calculus` · `Martin_Davis_(mathematician)` · `Marvin_Minsky` · `MathWorld` · `Mathematical_analysis` · `Mathematical_and_theoretical_biology` · `Mathematical_chemistry` · `Mathematical_economics` · `Mathematical_finance` · `Mathematical_induction` · [[Mathematical_optimization]] · `Mathematical_physics` · `Mathematical_psychology` · `Mathematical_sociology` · [[Mathematical_software]] · `Mathematics` · `Maximum_flow_problem` · `Memoization` · `Mesopotamia` · `Michael_T._Goodrich` · `Middle_Ages` · `Minimax` · `Monte_Carlo_algorithm` · `Multilinear_algebra` · `Multivariable_calculus` · `National_Institute_of_Standards_and_Technology` · `Nature_(journal)` · `Nicomachus` · `Note_G` · `Numerical_analysis` · `Numerical_linear_algebra` · `Numerical_methods_for_ordinary_differential_equations` · `Numerical_methods_for_partial_differential_equations` · `Online_algorithm` · [[Operations_research]] · `Operator_algebra` · `Operator_theory` · `Optimization_problem` · [[Ordinary_differential_equation]] · `Outline_of_algorithms` · `P_(complexity)` · `P_versus_NP_problem` · `Parallel_algorithm` · [[Partial_differential_equation]] · `Particle_physics_and_representation_theory` · `Perturbation_theory` · `Perturbation_theory_(quantum_mechanics)` · `Pidgin_code` · `Piotr_Indyk` · `Poisson_algebra` · `Potential_theory` · `Prim's_algorithm` · `Probability_distribution` · `Probability_theory` · `Profiling_(computer_programming)` · `Program_optimization` · `Programming_language` · `Proof_assistant` · `Prune_and_search` · `Pseudocode` · `Punched_card` · `Quantum_algorithm` · [[Quantum_computing]] · `Quantum_entanglement` · `Quantum_field_theory` · `Quantum_group` · `Quantum_superposition` · `Queue_(abstract_data_type)` · `RP_(complexity)` · `Random_variable` · `Randomized_algorithm` · `Randomness` · `Recipe` · [[Recommender_system]] · `Recursion` · [[Recursion_(computer_science)]] · `Reduction_(complexity)` · `Regulation_of_algorithms` · [[Reinforcement_learning]] · `Renormalization_group` · `Rhind_Mathematical_Papyrus` · `Richard_Jeffrey` · `Rigour` · `Robert_Kowalski` · `Robert_N._Bellah` · `Roberto_Simanowski` · `Roberto_Tamassia` · `Root-finding_algorithm` · `Search_algorithm` · `Segment_tree` · `Selection_algorithm` · `Shulba_Sutras` · `Shuruppak` · `Sieve_of_Eratosthenes` · `Simplex_algorithm` · `Simulated_annealing` · `Social_choice_theory` · `Society_for_Industrial_and_Applied_Mathematics` · `Société_de_Mathématiques_Appliquées_et_Industrielles` · `Software_patent` · `Software_patent_debate` · `Solver` · `Sorting_algorithm` · `Spacetime_algebra` · `Stack_(abstract_data_type)` · `Stanford_University` · `State-transition_table` · `State_diagram` · `Statistical_field_theory` · `Statistics` · `Stephen_Cole_Kleene` · `Stochastic_calculus` · `Stochastic_differential_equation` · `Stochastic_process` · `Streaming_algorithm` · `String-searching_algorithm` · `String_(computer_science)` · `String_theory` · `Structured_program_theorem` · `Sumer` · `Superalgebra` · `Supersymmetric_quantum_mechanics` · `Supersymmetric_theory_of_stochastic_dynamics` · `Supersymmetry` · `Supersymmetry_algebra` · `Sweep_line_algorithm` · `Synthetic_rubber` · `Tabu_search` · `Teleprinter` · [[Tensor]] · `Tensor_software` · `The_Canterbury_Tales` · `The_Unreasonable_Effectiveness_of_Mathematics_in_the_Natural_Sciences` · `The_Wall_Street_Journal` · `Theory_of_computation` · `Thomas_Hood_(mathematician)` · `Ticker_tape` · `Topological_sorting` · `Topological_string_theory` · `Tower_of_Hanoi` · `Tree_(abstract_data_type)` · `Trie` · `Turing_machine` · `Unisys` · `United_States_Patent_and_Trademark_Office` · `Validated_numerics` · `Vector_calculus` · `Verge_escapement` · `Volume` · [[Wayback_Machine]] · `Wikiversity` · `YouTube` · `Yuri_Gurevich` ## From the Real GENERATIVE library (beauty pass)  *Algorithm — image hotlinked from Wikimedia Commons (via the Real G.E.N.E.R.A.T.I.V.E. course library, Geometry room). [Details & license](https://commons.wikimedia.org/wiki/File:Acap.svg).* > In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/&#32;ⓘ) is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.&#91;1&#93; Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as au ([Wikipedia](https://en.wikipedia.org/wiki/Algorithm)) <!-- BEAUTY-PASS-MEDIA:END --> <!-- HYDRO-BRIDGE-POINTER:START --> > 🌊 **↓ 8 Hydrodynamics image bridges** — this page's ties to the Water Room atlas (jump to the section at the bottom). <!-- HYDRO-BRIDGE-POINTER:END --> The **ALGORITHM** acronym spells nine branches of [[Computer_science|computer science]], in order: **A**rchitecture · **L**ogic · **G**raphics · **O**ptimization · **R**einforcement learning · **I**nformation theory · **T**heory of computation · **H**ardware · **M**achine learning. This article is the **worklist**. It was seeded from the link-graph crawl in `A.L.G.O.R.I.T.H.M..csv` — **4,472 validated Wikipedia links**. Computer science is **heavily microsimmable** — algorithms *are* animations: a sort permutes bars, a graph search floods a maze, gradient descent rolls downhill, a Turing machine steps its tape, a neural net's loss surface deforms, and a rasterizer fills triangles. Each branch carries a short summary plus the most microsimmable child articles, grouped by p5.js MicroSim pattern and led by a build-first **top-10**. ← Related: [[Physics|PHYSICS]] · REACTION · COSMOS · [[Genomics|GENOMICS]] · FRACTALS · [[Medicine|MEDICINE]] · CLASSES · ENGINES · POETICS · GENERATIVE · standards in P5 JS EDITOR · best practices in MicroSim Best Practices · collision control in MicroSim-Registry *Slug note:* human-readable slugs. *Sheet note:* columns flipped (parent = col A, link = col B); parents have mixed case — match by keyword. **Status legend:** `- [ ]` unclaimed · `- [x] … *✅ <editor URL>*` shipped. --- > ## ✅ A ([[Architecture]]) re-crawled and fixed > > The sheet's **A** parent was `/wiki/Architecture` — *building* architecture, the wrong room. It has been replaced by a live Chrome re-crawl of **`Computer_architecture`**, yielding 87 microsimmable CPU/datapath/logic concepts (ALU, cache, pipeline, gates, FSM, FPGA, …). The stray **[[Computer_engineering]]** parent (352 links) remains available as a bonus crawl if wanted. --- ## Overview **Computer science** studies computation, [[Information|information]], and the machines that process them. The nine ALGORITHM branches: [[Computer_architecture|Architecture]] (CPU, cache, pipeline, logic), [[Logic|Logic]] (gates, automata, Boolean algebra), Graphics (rendering and geometry), [[Mathematical_optimization|Optimization]] (search and descent), [[Reinforcement_learning|Reinforcement learning]] (agents and rewards), [[Information_theory|Information theory]] ([[Entropy|entropy]] and coding), Theory of computation (automata and [[Complexity|complexity]]), [[Computer_hardware|Hardware]] (logic to chips), and [[Machine_learning|Machine learning]] (models that learn). Each is a "room" with its own worklist below. | Branch | Letter | Candidate links in sheet | Worklist status | |--------|:------:|:-----:|-----------------| | Architecture (computer) | A | re-crawled | ✅ 87 selected | | Logic | L | 604 | ✅ 130 selected | | Graphics | G | 176 | ✅ 33 selected ·filled | | Optimization | O | 476 | ✅ 178 selected | | Reinforcement learning | R | 779 | ✅ 123 selected | | Information theory | I | 609 | ✅ 226 selected | | Theory of computation | T | 74 | ✅ 32 selected ·filled | | Hardware | H | 33 | ✅ 4 selected ·filled ⚠️ under-seeded | | Machine learning | M | 454 | ✅ 125 selected | --- ## A — Architecture **87 articles** selected from a live Chrome re-crawl of the correct parent page, **`Computer_architecture`** (replacing the sheet's *building*-architecture mis-crawl), grouped by MicroSim pattern and led by a build-first top-10. Computer architecture is densely microsimmable: a datapath is a [[Block_diagram|block diagram]] you clock, a cache is a hit/miss animation, a pipeline is a stage chart that fills and stalls, a logic gate is a truth table you toggle. Dropped as people/places/products/other-room: the architects and pioneers (Babbage, Lovelace, Turing, von Neumann, Zuse, Tanenbaum, Patterson, Hennessy, Brooks, Bell, Blaauw, Barton), named machines and ISAs-as-products (IBM [[System]]/360, IBM 7030, VAX, PA-RISC, x86, Motorola 6800, Burroughs B5000, Z1), companies and journals (Intel, Morgan Kaufmann, IBM Systems Journal), `*_(identifier)` cruft, and the off-theme software/web tail (e-commerce, digital marketing, word processor, World Wide Web). ### Top 10 — start here (10) · *the canonical, most visual architecture sims* - [ ] Arithmetic logic unit - [x] CPU cache *✅ https://wikitube-3d-microsims.netlify.app/CPU_cache.html* - [ ] Pipeline (computing) - [ ] [[Logic_gate]] - [x] [[Finite-state_machine]] *✅ https://wikitube-3d-microsims.netlify.app/Finite-state_machine.html* - [x] Flynn's taxonomy *✅ https://wikitube-3d-microsims.netlify.app/Flynn%27s_taxonomy.html* - [x] [[Von_Neumann_architecture]] *✅ https://wikitube-3d-microsims.netlify.app/Von_Neumann_architecture.html* - [ ] Multiplexer - [ ] [[Flip-flop_(electronics)]] - [x] Microarchitecture *✅ https://wikitube-3d-microsims.netlify.app/Microarchitecture.html* ### CPU, datapath & instruction set (15) - [x] Central processing unit *✅ https://wikitube-3d-microsims.netlify.app/Central_processing_unit.html* - [ ] Microprocessor - [ ] Processor register - [x] Microcode *✅ https://wikitube-3d-microsims.netlify.app/Microcode.html* - [x] Instruction set architecture *✅ https://wikitube-3d-microsims.netlify.app/Instruction_set_architecture.html* - [ ] Instruction set - [ ] Addressing mode - [ ] Orthogonal instruction set - [ ] Instructions per cycle - [ ] Control flow - [x] Register-transfer level *✅ https://wikitube-3d-microsims.netlify.app/Register-transfer_level.html* - [x] Stored-program computer *✅ https://wikitube-3d-microsims.netlify.app/Stored-program_computer.html* - [ ] Machine code - [x] Transport triggered architecture *✅ https://wikitube-3d-microsims.netlify.app/Transport_triggered_architecture.html* - [ ] Bit-serial architecture ### Pipelining & parallelism (10) - [x] Superscalar processor *✅ https://wikitube-3d-microsims.netlify.app/Superscalar_processor.html* - [x] [[Multithreading_(computer_architecture)]] *✅ https://wikitube-3d-microsims.netlify.app/Multithreading_%28computer_architecture%29.html* - [ ] Parallel computing - [x] [[Multiprocessing]] *✅ https://wikitube-3d-microsims.netlify.app/Multiprocessing.html* - [ ] Hardware acceleration - [ ] Throughput - [ ] Latency (engineering) - [ ] Interrupt latency - [x] Dataflow architecture *✅ https://wikitube-3d-microsims.netlify.app/Dataflow_architecture.html* - [ ] Concurrency (computer science) ### Memory hierarchy (8) - [x] Computer memory *✅ https://wikitube-3d-microsims.netlify.app/Computer_memory.html* - [x] Virtual memory *✅ https://wikitube-3d-microsims.netlify.app/Virtual_memory.html* - [x] Memory cell (computing) *✅ https://wikitube-3d-microsims.netlify.app/Memory_cell_%28computing%29.html* - [ ] Memory organisation - [ ] Computer data storage - [ ] Direct memory access - [ ] Computer bus - [ ] Word (computer architecture) ### Digital logic & circuits (13) - [x] Combinational logic *✅ https://wikitube-3d-microsims.netlify.app/Combinational_logic.html* - [x] [[Sequential_logic]] *✅ https://wikitube-3d-microsims.netlify.app/Sequential_logic.html* - [x] Synchronous circuit *✅ https://wikitube-3d-microsims.netlify.app/Synchronous_circuit.html* - [x] Asynchronous circuit *✅ https://wikitube-3d-microsims.netlify.app/Asynchronous_circuit.html* - [x] Boolean circuit *✅ https://wikitube-3d-microsims.netlify.app/Boolean_circuit.html* - [ ] [[Transistor]] - [ ] Transistor–transistor logic - [ ] Emitter-coupled logic - [x] Metastability (electronics) *✅ https://wikitube-3d-microsims.netlify.app/Metastability_%28electronics%29.html* - [x] Runt pulse *✅ https://wikitube-3d-microsims.netlify.app/Runt_pulse.html* - [x] Switching circuit theory *✅ https://wikitube-3d-microsims.netlify.app/Switching_circuit_theory.html* - [x] Circuit minimization for Boolean functions *✅ https://wikitube-3d-microsims.netlify.app/Circuit_minimization_for_Boolean_functions.html* - [x] Logic synthesis *✅ https://wikitube-3d-microsims.netlify.app/Logic_synthesis.html* ### Architectures & models of computation (9) - [x] Harvard architecture *✅ https://wikitube-3d-microsims.netlify.app/Harvard_architecture.html* - [x] Modified Harvard architecture *✅ https://wikitube-3d-microsims.netlify.app/Modified_Harvard_architecture.html* - [ ] Comparison of CPU architectures - [ ] Model of computation - [ ] [[Quantum_computing]] - [ ] Reconfigurable computing - [ ] Stochastic computing - [ ] [[Real-time_computing]] - [ ] Virtual machine ### Programmable logic & VLSI (12) - [ ] Field-programmable gate array - [x] Programmable logic device *✅ https://wikitube-3d-microsims.netlify.app/Programmable_logic_device.html* - [x] Programmable logic array *✅ https://wikitube-3d-microsims.netlify.app/Programmable_logic_array.html* - [x] Programmable Array Logic *✅ https://wikitube-3d-microsims.netlify.app/Programmable_Array_Logic.html* - [x] Generic Array Logic *✅ https://wikitube-3d-microsims.netlify.app/Generic_Array_Logic.html* - [x] Complex programmable logic device *✅ https://wikitube-3d-microsims.netlify.app/Complex_programmable_logic_device.html* - [x] Macrocell array *✅ https://wikitube-3d-microsims.netlify.app/Macrocell_array.html* - [x] [[Very-large-scale_integration]] *✅ https://wikitube-3d-microsims.netlify.app/Very-large-scale_integration.html* - [ ] Integrated circuit - [ ] System on a chip - [x] Three-dimensional integrated circuit *✅ https://wikitube-3d-microsims.netlify.app/Three-dimensional_integrated_circuit.html* - [x] Hardware description language *✅ https://wikitube-3d-microsims.netlify.app/Hardware_description_language.html* ### Performance, metrics & accelerators (10) - [x] Clock rate *✅ https://wikitube-3d-microsims.netlify.app/Clock_rate.html* - [ ] Moore's law - [x] Performance per watt *✅ https://wikitube-3d-microsims.netlify.app/Performance_per_watt.html* - [ ] Computer performance - [ ] Benchmark (computing) - [x] Floating-point arithmetic *✅ https://wikitube-3d-microsims.netlify.app/Floating-point_arithmetic.html* - [x] [[Binary_number]] *✅ https://wikitube-3d-microsims.netlify.app/Binary_number.html* - [x] [[Graphics_processing_unit]] *✅ https://wikitube-3d-microsims.netlify.app/Graphics_processing_unit.html* - [x] Tensor Processing Unit *✅ https://wikitube-3d-microsims.netlify.app/Tensor_Processing_Unit.html* - [ ] Supercomputer ## L — Logic Logic is the study of correct reasoning — the forms of argument that preserve truth, the formal languages that express them, and the rules and proofs that carry premises to a conclusion. In a computer-[[Science|science]] worklist it is the most directly microsimmable branch of all: a truth table is a grid the learner fills in, a logic gate flips its output as the inputs are toggled, a connective is a switch, a syllogism is a Venn overlay, the square of opposition is a clickable diagram, a natural-deduction proof is a tree that grows one rule at a time, modal logic is a graph of possible worlds the learner walks, fuzzy logic is a bank of sliders between 0 and 1, and Cantor's diagonal or Russell's paradox is an animation that assembles the contradiction line by line. **130 articles** selected from the 604 validated candidates by the quality bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. The pool was heavily diluted: the crawl came from the broad **Logic** philosophy page, so the bulk of the 604 were the **philosophy navbox** (hundreds of schools, traditions, and national philosophies — Stoicism, Confucianism, Vedanta, German idealism, pragmatism, phenomenology … — plus the "Philosophy of X" and "X philosophy" pages), the long roster of **logicians** (Frege, Tarski, Boole, Peirce, Russell, Gödel, Cantor, Leibniz, Łukasiewicz, Kleene, and a full bibliography of contributors), **books and notations** (the *Organon*, *Prior [[Analytics]]*, *Principia Mathematica*, *Begriffsschrift*, the *Sum of Logic*), generic disciplines and linguistics (Mathematics, Epistemology, and grammar/sentence/denotation pages), and the usual `Category:*`, `Template_talk:*`, `List_of_*`, `Outline_of_*`, `*_(identifier)`, and `*_(disambiguation)` cruft. Those were dropped as people / books / off-theme / non-microsimmable rather than padded in. Synonym twins were collapsed to one slug each (Boolean_logic → `Boolean_algebra`; Propositional_logic → `Propositional_calculus`; Aristotelian_logic → `Term_logic`; Logical_connectives → `Logical_connective`; Conjunction_(logic) → `Logical_conjunction`; Fallacies → `Fallacy`; Informal_fallacies → `Informal_fallacy`; Soundness_(logic) → `Soundness`). Topics that belong to later ALGORITHM rooms were reserved for them (Turing_machines and Computability_theory → Theory of computation; Transistor → Hardware). ### Top 10 — start here (10) · *the most canonical, visually striking logic sims; build these first* - [x] Truth table *✅ https://wikitube-3d-microsims.netlify.app/Truth_table.html* - [ ] Logic gates - [ ] Boolean algebra - [x] Logical connective *✅ https://wikitube-3d-microsims.netlify.app/Logical_connective.html* - [x] Syllogism *✅ https://wikitube-3d-microsims.netlify.app/Syllogism.html* - [x] Square of opposition *✅ https://wikitube-3d-microsims.netlify.app/Square_of_opposition.html* - [x] Modus ponens *✅ https://wikitube-3d-microsims.netlify.app/Modus_ponens.html* - [x] Propositional calculus *✅ https://wikitube-3d-microsims.netlify.app/Propositional_calculus.html* - [x] [[First-order_logic]] *✅ https://wikitube-3d-microsims.netlify.app/First-order_logic.html* - [x] Modal logic *✅ https://wikitube-3d-microsims.netlify.app/Modal_logic.html* ### Truth tables, connectives & Boolean algebra (15) · *truth-table / gate builder; toggle the inputs and read the output column* - [x] Truth function *✅ https://wikitube-3d-microsims.netlify.app/Truth_function.html* - [ ] Truth value - [x] Logical conjunction *✅ https://wikitube-3d-microsims.netlify.app/Logical_conjunction.html* - [x] Logical disjunction *✅ https://wikitube-3d-microsims.netlify.app/Logical_disjunction.html* - [x] Negation *✅ https://wikitube-3d-microsims.netlify.app/Negation.html* - [x] Material conditional *✅ https://wikitube-3d-microsims.netlify.app/Material_conditional.html* - [x] Sheffer stroke *✅ https://wikitube-3d-microsims.netlify.app/Sheffer_stroke.html* - [x] Double negation elimination *✅ https://wikitube-3d-microsims.netlify.app/Double_negation_elimination.html* - [x] Converse (logic) *✅ https://wikitube-3d-microsims.netlify.app/Converse_%28logic%29.html* - [x] Inverse (logic) *✅ https://wikitube-3d-microsims.netlify.app/Inverse_%28logic%29.html* - [x] Contrapositive (logic) *✅ https://wikitube-3d-microsims.netlify.app/Contrapositive_%28logic%29.html* - [x] Vector logic *✅ https://wikitube-3d-microsims.netlify.app/Vector_logic.html* - [x] Principle of bivalence *✅ https://wikitube-3d-microsims.netlify.app/Principle_of_bivalence.html* - [x] Principle of distributivity *✅ https://wikitube-3d-microsims.netlify.app/Principle_of_distributivity.html* - [ ] Truth condition ### Rules of inference & proof construction (9) · *derivation / proof-step animator; apply a rule and grow the proof tree* - [x] Rule of inference *✅ https://wikitube-3d-microsims.netlify.app/Rule_of_inference.html* - [x] Conjunction introduction *✅ https://wikitube-3d-microsims.netlify.app/Conjunction_introduction.html* - [x] Natural deduction *✅ https://wikitube-3d-microsims.netlify.app/Natural_deduction.html* - [x] Sequent calculus *✅ https://wikitube-3d-microsims.netlify.app/Sequent_calculus.html* - [x] Hypothetical syllogism *✅ https://wikitube-3d-microsims.netlify.app/Hypothetical_syllogism.html* - [x] Denying the antecedent *✅ https://wikitube-3d-microsims.netlify.app/Denying_the_antecedent.html* - [ ] Substitution (logic) - [ ] Deductive closure - [x] Inference *✅ https://wikitube-3d-microsims.netlify.app/Inference.html* ### Arguments, validity & kinds of reasoning (17) · *argument-map / validity checker / Bayesian-update sim* - [x] Argument *✅ https://wikitube-3d-microsims.netlify.app/Argument.html* - [ ] Argumentation theory - [ ] Premise - [x] Validity (logic) *✅ https://wikitube-3d-microsims.netlify.app/Validity_%28logic%29.html* - [ ] Soundness - [ ] Logical truth - [x] Logical consequence *✅ https://wikitube-3d-microsims.netlify.app/Logical_consequence.html* - [x] Tautology (logic) *✅ https://wikitube-3d-microsims.netlify.app/Tautology_%28logic%29.html* - [x] [[Deductive_reasoning]] *✅ https://wikitube-3d-microsims.netlify.app/Deductive_reasoning.html* - [x] [[Inductive_reasoning]] *✅ https://wikitube-3d-microsims.netlify.app/Inductive_reasoning.html* - [x] Abductive reasoning *✅ https://wikitube-3d-microsims.netlify.app/Abductive_reasoning.html* - [x] Logical reasoning *✅ https://wikitube-3d-microsims.netlify.app/Logical_reasoning.html* - [ ] Defeasible reasoning - [ ] Method of reasoning - [ ] Mill's Methods - [ ] Bayesian epistemology - [ ] Subjective probability ### Propositional & predicate logic, formal systems (17) · *formula builder / parser; assemble well-formed formulas and interpret them* - [x] Predicate (mathematical logic) *✅ https://wikitube-3d-microsims.netlify.app/Predicate_%28mathematical_logic%29.html* - [x] Higher-order logic *✅ https://wikitube-3d-microsims.netlify.app/Higher-order_logic.html* - [x] Quantifier (logic) *✅ https://wikitube-3d-microsims.netlify.app/Quantifier_%28logic%29.html* - [x] Existential quantification *✅ https://wikitube-3d-microsims.netlify.app/Existential_quantification.html* - [x] Well-formed formula *✅ https://wikitube-3d-microsims.netlify.app/Well-formed_formula.html* - [ ] [[Formal_system]] - [ ] Formal language - [x] Formal proof *✅ https://wikitube-3d-microsims.netlify.app/Formal_proof.html* - [ ] Proof system - [ ] Syntax (logic) - [x] Logical form *✅ https://wikitube-3d-microsims.netlify.app/Logical_form.html* - [x] Interpretation (logic) *✅ https://wikitube-3d-microsims.netlify.app/Interpretation_%28logic%29.html* - [ ] Semantics of logic - [ ] Symbol (formal) - [ ] Formal semantics (natural language) - [ ] Principle of compositionality - [ ] Logic translation ### Syllogistic & term logic (4) · *square-of-opposition / Venn-style categorical sim* - [x] Categorical propositions *✅ https://wikitube-3d-microsims.netlify.app/Categorical_propositions.html* - [x] Term logic *✅ https://wikitube-3d-microsims.netlify.app/Term_logic.html* - [ ] Stoic logic - [x] Classical logic *✅ https://wikitube-3d-microsims.netlify.app/Classical_logic.html* ### Modal & non-classical logics (15) · *possible-worlds graph / multi-valued slider explorer* - [x] Deontic logic *✅ https://wikitube-3d-microsims.netlify.app/Deontic_logic.html* - [x] Epistemic modal logic *✅ https://wikitube-3d-microsims.netlify.app/Epistemic_modal_logic.html* - [x] Temporal logic *✅ https://wikitube-3d-microsims.netlify.app/Temporal_logic.html* - [x] Intuitionistic logic *✅ https://wikitube-3d-microsims.netlify.app/Intuitionistic_logic.html* - [x] Paraconsistent logic *✅ https://wikitube-3d-microsims.netlify.app/Paraconsistent_logic.html* - [x] Fuzzy logics *✅ https://wikitube-3d-microsims.netlify.app/Fuzzy_logics.html* - [x] Multi-valued logics *✅ https://wikitube-3d-microsims.netlify.app/Multi-valued_logics.html* - [x] Ternary logic *✅ https://wikitube-3d-microsims.netlify.app/Ternary_logic.html* - [x] Quantum logic *✅ https://wikitube-3d-microsims.netlify.app/Quantum_logic.html* - [x] Non-monotonic logic *✅ https://wikitube-3d-microsims.netlify.app/Non-monotonic_logic.html* - [ ] Deviant logic - [ ] Non-classical logic - [ ] Dialetheism - [ ] Imperative logic - [x] Possible world *✅ https://wikitube-3d-microsims.netlify.app/Possible_world.html* ### Computational & mathematical logic (8) · *theorem-prover / logic-programming trace; resolve clauses step by step* - [x] Computational logic *✅ https://wikitube-3d-microsims.netlify.app/Computational_logic.html* - [ ] Logic in computer science - [ ] Mathematical logic - [ ] Informal logic - [x] Automatic theorem prover *✅ https://wikitube-3d-microsims.netlify.app/Automatic_theorem_prover.html* - [x] Logic programming *✅ https://wikitube-3d-microsims.netlify.app/Logic_programming.html* - [x] Logic puzzle *✅ https://wikitube-3d-microsims.netlify.app/Logic_puzzle.html* - [ ] Expressive power (computer science) ### Model theory, metalogic & metalogical properties (7) · *model / completeness explorer; test soundness, completeness, decidability* - [ ] Model theory - [ ] Proof theory - [ ] Metalogic - [x] Completeness (logic) *✅ https://wikitube-3d-microsims.netlify.app/Completeness_%28logic%29.html* - [x] Consistency *✅ https://wikitube-3d-microsims.netlify.app/Consistency.html* - [x] Decidability (logic) *✅ https://wikitube-3d-microsims.netlify.app/Decidability_%28logic%29.html* - [ ] Axiom ### Laws, principles & formula structure (10) · *law-of-thought / connective-structure sim* - [x] Law of excluded middle *✅ https://wikitube-3d-microsims.netlify.app/Law_of_excluded_middle.html* - [x] Principle of explosion *✅ https://wikitube-3d-microsims.netlify.app/Principle_of_explosion.html* - [ ] Logical necessity - [x] [[Necessity_and_sufficiency]] *✅ https://wikitube-3d-microsims.netlify.app/Necessity_and_sufficiency.html* - [x] Contradiction *✅ https://wikitube-3d-microsims.netlify.app/Contradiction.html* - [ ] Antecedent (logic) - [ ] Consequent - [x] [[Proposition]] *✅ https://wikitube-3d-microsims.netlify.app/Proposition.html* - [ ] Statement (logic) - [x] Laws of thought *✅ https://wikitube-3d-microsims.netlify.app/Laws_of_thought.html* ### Set theory, foundations & famous theorems (10) · *diagonal-argument / paradox builder; construct the contradiction line by line* - [x] [[Set_theory]] *✅ https://wikitube-3d-microsims.netlify.app/Set_theory.html* - [ ] Russell's paradox - [ ] Cantor's theorem - [ ] Continuum hypothesis - [ ] Axiom of Choice - [ ] Gödel's incompleteness theorem - [ ] Hilbert's program - [ ] Foundations of mathematics - [ ] Logicism - [ ] Large cardinal ### Paradoxes & fallacies (8) · *fallacy-classifier / paradox sim; spot the broken inference* - [ ] Paradox - [ ] Antinomy - [ ] White horse paradox - [ ] Fallacy - [x] Formal fallacy *✅ https://wikitube-3d-microsims.netlify.app/Formal_fallacy.html* - [ ] Informal fallacy - [ ] False dilemma - [ ] Fallacy of begging the question ## G — Graphics Computer graphics turns numbers into pictures — and almost every step is an animation a learner can drive. A raster image is a grid of pixels you can zoom until the squares show; a vector shape is a path you rescale without blur; a 3D scene is a mesh you orbit while a shader lights each face; a ray tracer fires rays from the eye through the screen into the world; a chart binds data to marks; a colour space is a solid you move a point through; and a geometric transform translates, rotates, scales, or shears a shape in real time. These are the canonical p5.js MicroSims: a canvas, a few sliders, and an idea made visible. **33 articles** selected from the 176 validated candidates by the bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. The crawl came from the general **`Graphics`** page (visual images at large) rather than `Computer_graphics`, so the pool was dominated by off-theme material that was dropped rather than padded: the **people** (Leonardo da Vinci, Ivan Sutherland, Douglas T. Ross, Steven Coons, Paul Rand, William Caslon, Aldus Manutius, Shepard Fairey, Daniel Hopfer), **companies and labs** (Bell Labs, Silicon Graphics, Pixar, Atari, Boeing, General Motors, Lockheed, IBM, NeXT, MIT), **named software / products / machines** (Photoshop, GIMP, Paint Shop Pro, Maya, 3ds Max, Cinema 4D, Sketchpad, DAC-1, Whirlwind, TX-0/TX-2, PLATO), **file formats and standards** (GIF, JPEG, PNG, SVG, SWF, X3D, VML), **films and games** (Toy Story, the LOTR / Harry Potter / Spider-Man series, Battlezone, Spasim, FS1), **publications** (Time, Wired, Newsweek, academic journals), **art-history and printmaking craft** (cave painting, woodcut, engraving, etching, intaglio, the *Hope* poster), **materials, places and eras** (papyrus, limestone, China, Augsburg, the Upper Palaeolithic), plus broad umbrella topics (Software, Multimedia, Science, Geography, Economics) and the usual `Category:*` / `(disambiguation)` cruft. A `Computer_graphics` re-crawl would deepen the rendering-pipeline coverage (rasterization, clipping, Bézier / spline curves, z-buffering, texture mapping) that the general page never reached. ### Top 10 — start here (10) · *the canonical, most visual graphics sims; build these first* - [ ] Ray tracing (graphics) - [x] Raster graphics *✅ https://wikitube-3d-microsims.netlify.app/Raster_graphics.html* - [ ] Vector graphics - [ ] 3D computer graphics - [ ] Shading - [ ] Color - [ ] Pythagorean theorem - [x] [[Graph_of_a_function]] *✅ https://wikitube-3d-microsims.netlify.app/Graph_of_a_function.html* - [ ] Animation - [ ] 3D modeling ### Raster, vector, type & screen rendering (5) · *pixel-grid vs resolution-independent paths; zoom the bitmap, scale the glyph, lay out the screen* - [ ] Computer graphics (computer science) - [ ] Image - [ ] Line art - [ ] Typeface - [ ] Graphical user interface ### Geometry & spatial transforms (4) · *coordinate / transform sims; translate, rotate, scale, and shear the shape* - [ ] [[Geometry]] - [ ] 2D geometric model - [ ] Three-dimensional space - [ ] Italic type ### Cameras, lenses & image capture (4) · *optical-path / frustum sims; move the lens, set the field of view, filter the light* - [x] Field of view *✅ https://wikitube-3d-microsims.netlify.app/Field_of_view.html* - [ ] Photographic lens - [ ] Filter (photography) - [ ] Digital photography ### Colour, perception & the visual system (3) · *colour-wheel / illusion sims; mix the hue, trigger the percept* - [ ] Hue - [ ] Visual perception - [ ] Visual system ### Charts & plots (3) · *plot-builder sims; bind data to marks and read the trend* - [ ] [[Line_chart]] - [ ] Chart - [ ] Financial chart ### Diagrams, maps & technical drawing (4) · *projection / node-link sims; map the data onto the plane* - [ ] Diagram - [ ] Information graphics - [ ] Map - [ ] [[Engineering_drawing]] ## O — Optimization Optimization is the search for the best element of a set under a criterion — the highest peak or deepest valley of an objective function, often subject to constraints. It is among the most vividly microsimmable branches in all of computer science, because every method *is* a motion across a landscape: gradient descent rolls a ball downhill, the simplex algorithm walks the vertices of a feasible polytope, simulated annealing hops with a cooling temperature, a [[Genetic_algorithm|genetic algorithm]] breeds a population toward fitness, Newton's method fits a parabola and leaps to its vertex, a Lagrange multiplier slides a constraint curve until it kisses a contour line, branch-and-bound prunes a search tree, and Dijkstra's frontier floods a graph toward the shortest path. Loss surfaces, contour plots, Pareto fronts, and convex hulls are all canvas-native. **178 articles** selected from the 476 validated candidates by the quality bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. The pool was diluted by two large navboxes and an economics roster crawled from the broad **Optimization** page: the **areas-of-mathematics** footer (Algebra, Topology, Number theory, the geometry and analysis sub-fields, Mathematics education …) and the **systems-[[Engineering|engineering]]** footer ([[Requirements_engineering|requirements engineering]], [[Configuration_management|configuration management]], the V-model, project/quality/risk management …) were dropped wholesale as off-theme generic fields, as were the long roster of **people** (Fermat, Lagrange, Newton, Gauss, Dantzig, Kantorovich, Karmarkar, Khachiyan, Kuhn, Tucker, Nesterov, Nemirovski, Rockafellar, Nocedal, and the systems-engineering biographies), **books / journals / societies** (the *New Palgrave Dictionary*, *American Economic Review*, the Mathematical Optimization [[Society]]), and the usual `Category:*`, `Template_talk:*`, `List_of_*`, `Comparison_of_*`, `*_(identifier)`, and `(disambiguation)` cruft. Broad math primitives (Integer, Subset, Matrix, Variable) and off-theme application domains (power-flow analysis, seismology, molecular modeling) were dropped as non-microsimmable or belonging to other rooms; branch-parent topics were reserved for their own rooms (Machine_learning → M; Information_theory → I; Theory_of_computation and Computational_complexity_theory → T). Synonym twins were collapsed to one slug each (Evolutionary_algorithms → `Evolutionary_algorithm`; Iterative_methods → `Iterative_method`; Interior_point_methods → `Interior-point_method`; Heuristic_algorithm → `Heuristic_(computer_science)`; Convex_minimization → `Convex_optimization`; Positive_definite_matrix → `Definite_matrix`; Lipschitz_function → `Lipschitz_continuity`). ### Top 10 — start here (10) · *the most canonical, visually striking optimization sims; build these first* - [ ] Gradient descent - [ ] Simplex algorithm - [ ] Simulated annealing - [ ] Linear programming - [ ] Convex optimization - [ ] Newton's method in optimization - [ ] Genetic algorithms - [ ] Hill climbing - [ ] Lagrange multiplier - [ ] Pareto frontier ### The objective landscape: minima, maxima & critical points (15) · *surface-plot / contour explorer; drag the point and watch the objective fall* - [ ] Maxima and minima - [ ] Global minimum - [ ] Global optimization - [ ] Arg max - [ ] Stationary point - [ ] Critical point (mathematics) - [ ] Saddle point - [ ] First derivative test - [ ] Second derivative test - [x] Extreme value theorem *✅ https://wikitube-3d-microsims.netlify.app/Extreme_value_theorem.html* - [ ] Fermat's theorem (stationary points) - [ ] Test functions for optimization - [ ] Loss function - [ ] Maximum theorem - [ ] Envelope theorem ### Gradient & descent methods (11) · *ball-rolling-downhill / vector-field animation* - [ ] Gradient - [ ] Coordinate descent - [ ] Conjugate gradient method - [ ] Nonlinear conjugate gradient method - [ ] Mirror descent - [ ] Subgradient method - [ ] Subgradient - [ ] Line search - [ ] Trust region - [ ] Simultaneous perturbation stochastic approximation - [ ] Stochastic optimization ### Newton & quasi-Newton methods (13) · *tangent-parabola / curvature-step animator* - [ ] Quasi-Newton method - [ ] BFGS method - [ ] Broyden–Fletcher–Goldfarb–Shanno algorithm - [ ] Limited-memory BFGS - [ ] Davidon–Fletcher–Powell formula - [ ] Symmetric rank-one - [ ] Gauss–Newton algorithm - [ ] Levenberg–Marquardt algorithm - [ ] Powell's dog leg method - [ ] Truncated Newton method - [ ] Berndt–Hall–Hall–Hausman algorithm - [ ] Hessian matrix - [ ] Successive parabolic interpolation ### Convexity, sets & the geometry of feasible regions (14) · *draggable convex-hull / polytope sim* - [ ] Convex function - [ ] Convex set - [ ] Convex analysis - [ ] Concave function - [ ] Quasiconvex function - [x] [[Polyhedron]] *✅ https://wikitube-3d-microsims.netlify.app/Polyhedron.html* - [x] [[Polytope]] *✅ https://wikitube-3d-microsims.netlify.app/Polytope.html* - [x] Bounded set *✅ https://wikitube-3d-microsims.netlify.app/Bounded_set.html* - [ ] Feasible set - [ ] Feasible solution - [ ] Definite matrix - [ ] Lipschitz continuity - [ ] Interval (mathematics) - [ ] Constraint (mathematics) ### Linear programming & the simplex method (14) · *pivoting-on-a-polytope / interior-path sim* - [ ] Revised simplex method - [ ] Criss-cross algorithm - [ ] Linear-fractional programming - [ ] Slack variable - [ ] Dual problem - [ ] Cutting-plane method - [ ] Ellipsoid method - [ ] Interior-point method - [ ] Affine scaling - [ ] Karmarkar's algorithm - [ ] Active-set method - [ ] Exchange algorithm - [ ] Lemke's algorithm - [ ] Relaxation (approximation) ### Constrained optimization & duality (13) · *Lagrangian / KKT-tangency visual* - [ ] Constrained optimization - [ ] Karush–Kuhn–Tucker conditions - [ ] Lagrangian relaxation - [ ] Barrier function - [ ] Penalty method - [ ] Augmented Lagrangian method - [ ] Wolfe conditions - [ ] Variational inequalities - [ ] Complementarity theory - [ ] Linear complementarity problem - [ ] Comparative statics - [x] [[Calculus_of_variations]] *✅ https://wikitube-3d-microsims.netlify.app/Calculus_of_variations.html* - [x] [[Optimal_control]] *✅ https://wikitube-3d-microsims.netlify.app/Optimal_control.html* ### Problem classes: nonlinear, quadratic, conic & integer programming (16) · *problem-class catalog / feasible-region builder* - [ ] Continuous optimization - [ ] Discrete optimization - [ ] Optimization problem - [ ] Convex programming - [ ] Nonlinear programming - [ ] Quadratic programming - [ ] Second-order cone programming - [ ] Semidefinite programming - [ ] Conic programming - [ ] Geometric programming - [ ] Integer programming - [ ] Fractional programming - [ ] Stochastic programming - [ ] Robust optimization - [ ] Goal programming - [ ] Mathematical programming with equilibrium constraints ### Metaheuristics & nature-inspired search (16) · *agent-swarm / evolving-population sim* - [ ] Metaheuristic - [ ] Evolutionary algorithm - [ ] Differential evolution - [ ] Memetic algorithm - [ ] [[Particle_swarm_optimization]] - [ ] Stochastic tunneling - [ ] Tabu search - [ ] Spiral optimization algorithm - [ ] Parallel metaheuristic - [ ] Pattern search (optimization) - [ ] Nelder–Mead method - [ ] Local search (optimization) - [ ] Bayesian optimization - [ ] Heuristic (computer science) - [ ] Dynamic relaxation - [ ] Surrogate model ### Combinatorial & graph optimization (24) · *network-flood / max-flow animation* - [x] [[Combinatorial_optimization]] *✅ https://wikitube-3d-microsims.netlify.app/Combinatorial_optimization.html* - [ ] Branch and bound - [ ] Branch and cut - [ ] Approximation algorithm - [ ] Greedy algorithm - [ ] Graph algorithm - [ ] Minimum spanning tree - [ ] Borůvka's algorithm - [ ] Prim's algorithm - [ ] Kruskal's algorithm - [ ] Shortest path problem - [ ] Bellman–Ford algorithm - [ ] Shortest Path Faster Algorithm - [ ] Dijkstra's algorithm - [ ] Floyd–Warshall algorithm - [ ] Dinic's algorithm - [ ] Edmonds–Karp algorithm - [ ] Ford–Fulkerson algorithm - [ ] Push–relabel maximum flow algorithm - [ ] Flow network - [ ] Vehicle routing problem - [ ] Matroid - [ ] Constraint satisfaction - [ ] Constraint programming ### Dynamic programming, optimal control & multi-objective (11) · *stage/value-table fill · Pareto-front explorer* - [x] [[Dynamic_programming]] *✅ https://wikitube-3d-microsims.netlify.app/Dynamic_programming.html* - [ ] Bellman equation - [x] [[Model_predictive_control]] *✅ https://wikitube-3d-microsims.netlify.app/Model_predictive_control.html* - [ ] Brachistochrone curve - [ ] Multi-objective optimization - [ ] Pareto set - [ ] Vector optimization - [ ] Multidisciplinary design optimization - [ ] Satisfiability problem - [ ] Space mapping - [ ] Frank–Wolfe algorithm ### Iterative numerical methods, root-finding & fitting (12) · *convergence-trace / least-squares-fit sim* - [ ] Iterative method - [ ] Numerical analysis - [ ] Golden-section search - [ ] Powell's method - [ ] Finite difference - [ ] Interpolation - [ ] Curve fitting - [ ] Least squares - [ ] Local convergence - [ ] Sequential quadratic programming - [ ] Successive linear programming - [ ] Deterministic global optimization ### Applications: economics, finance & process optimization (9) · *efficient-frontier / utility-maximization sim* - [ ] Utility maximization problem - [ ] Expenditure minimization problem - [ ] [[Game_theory]] - [ ] Portfolio (finance) - [ ] Risk aversion - [x] Process optimization *✅ https://wikitube-3d-microsims.netlify.app/Process_optimization.html* - [ ] Simulation-based optimization - [ ] Resource leveling - [ ] Quantum optimization algorithms ## R — Reinforcement learning Reinforcement learning is the study of agents that learn by acting — an agent observes a state, chooses an action, collects a reward, and updates its policy to earn more reward over time. It is one of the most vividly microsimmable corners of computer science, because every method *is* an animation a learner can drive: a value table fills cell by cell as an agent wanders a gridworld, a Q-learning update backs a reward up the path that earned it, a multi-armed bandit's arms glow as their estimates sharpen, the exploration–exploitation dial trades a known reward for a risky probe, a Markov decision process draws its states and transition arrows, Monte-Carlo tree search grows and prunes a game tree, and a policy-gradient agent nudges its network toward higher return. In modern practice reinforcement learning is *deep* reinforcement learning, so this room also gathers the neural-network, [[Sequence|sequence]], attention, and generative/world-model machinery that powers learning agents — each a canvas-native sim of a forward pass, a backprop sweep, an attention heatmap, or a denoising rollout. **123 articles** selected from the 779 validated candidates — the largest pool in the hub — by the bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. The crawl came from the broad **`Reinforcement_Learning`** page, which drags in the entire artificial-intelligence / machine-learning / [[Robotics|robotics]] navbox, so the pool was heavily diluted and most of it was dropped rather than padded: the long roster of **people** (Sutton, Barto, Hinton, LeCun, Bengio, Schmidhuber, Minsky, Turing, von Neumann, Rosenblatt, Hopfield, Hassabis, Sutskever, …), **companies and robot-hardware makers** (Boston Dynamics, Unitree, FANUC, KUKA, ABB, Agility, iRobot, Figure AI, Waymo, Zoox, …), **named software / products / models** (ChatGPT, AlphaGo, AlphaZero, MuZero, DALL·E, Midjourney, Stable [[Diffusion]], IBM Watson, OpenAI Five, …), **AI policy / society / ethics** pages (AI safety, AI alignment, AI winter, regulation, technological unemployment, …), **conferences and journals** (NeurIPS, ICML, ICLR, CVPR, AAAI, …), and broad infrastructure / other-room CS (operating systems, databases, networks, computer-vision and NLP applications, robotics hardware) plus the usual `Category:*`, `Template_talk:*`, `List_of_*`, `Outline_of_*`, and `*_(identifier)` cruft. Topics already built in other rooms were excluded as within-page duplicates (Gradient_descent, Simulated_annealing, Dynamic_programming, Bellman_equation, Optimal_control, Game_theory, Quantum_computing → already in O/A). The **classical statistical machine-learning signature** — supervised regression and classifiers (linear/logistic regression, SVM, naive Bayes, k-NN, decision trees, random forests, boosting, bagging, ensembles), unsupervised clustering (k-means, DBSCAN, OPTICS, BIRCH, hierarchical, mean-shift), dimensionality reduction (PCA, ICA, LDA, t-SNE, NMF), model evaluation (cross-validation, ROC, confusion matrix, overfitting, bias–variance), and learning theory (PAC, VC dimension, empirical risk minimization) — was **reserved for the [[Machine_learning|M — Machine learning]] room** so the two learning branches stay distinct and non-overlapping. Synonym/near-twins were collapsed to one slug each (Transformer_(deep_learning) → `Transformer_(deep_learning_architecture)`; Optimal_control_theory → O's `Optimal_control`). ### Top 10 — start here (10) · *the canonical, most visual RL sims; build these first* - [x] [[Reinforcement_learning]] *✅ https://wikitube-3d-microsims.netlify.app/Reinforcement_learning.html* - [ ] Markov decision process - [ ] Q-learning - [ ] Temporal difference learning - [ ] Multi-armed bandit - [ ] Policy iteration - [ ] Value iteration - [ ] Exploration–exploitation dilemma - [ ] Monte Carlo tree search - [ ] Deep reinforcement learning ### Reinforcement-learning core: agents, rewards & policies · *agent-in-a-gridworld sim; step the policy, watch the value table fill* - [ ] Reinforcement - [ ] Model-free (reinforcement learning) - [ ] State–action–reward–state–action - [ ] Actor-critic algorithm - [ ] Policy gradient method - [ ] Proximal Policy Optimization - [ ] Distributional Soft Actor Critic - [ ] Value function - [ ] Temporal difference - [ ] Cross-entropy method - [ ] End-to-end reinforcement learning - [ ] Multi-agent reinforcement learning - [ ] Reinforcement learning from human feedback - [ ] Self-play (reinforcement learning technique) - [ ] Reward-based selection - [ ] Predictive state representation - [ ] Regret (decision theory) - [ ] Operant conditioning - [ ] Error-driven learning - [x] Dopamine *✅ https://wikitube-3d-microsims.netlify.app/Dopamine.html* - [ ] Basal ganglia ### Markov models, Monte Carlo & probabilistic foundations · *Markov-chain / sampling animation; roll the transitions, estimate the value* - [ ] Markov chain - [ ] Partially observable Markov decision process - [ ] Hidden Markov model - [ ] Bayesian network - [ ] Graphical model - [x] [[Monte_Carlo_method]] ⭐ *✅ https://wikitube-3d-microsims.netlify.app/Monte_Carlo_method.html* - [ ] Monte Carlo sampling ### Agents, planning, search & control · *planning / control-loop sim; plan a path, close the feedback loop, evolve a population* - [ ] Intelligent agent - [ ] AI agent - [ ] [[Multi-agent_system]] - [ ] Action selection - [ ] Automated planning and scheduling - [ ] Motion planning - [ ] [[Control_theory]] - [ ] Swarm intelligence - [ ] [[Evolutionary_computation]] - [x] [[Fuzzy_control_system]] *✅ https://wikitube-3d-microsims.netlify.app/Fuzzy_control_system.html* - [ ] Fuzzy rule - [ ] Cognitive architecture - [ ] ACT-R - [ ] Soar (cognitive architecture) - [ ] CLARION (cognitive architecture) - [ ] LIDA (cognitive architecture) - [ ] Vision-language-action model - [ ] Simulation ### Learning paradigms & representation · *paradigm explorer; compare how the agent learns from rewards, demos, or unlabeled data* - [ ] Apprenticeship learning - [ ] Imitation learning - [ ] Intrinsic motivation (artificial intelligence) - [ ] Curriculum learning - [ ] Meta-learning (computer science) - [ ] Self-supervised learning - [ ] Semi-supervised learning - [ ] Transfer learning - [ ] Multi-task learning - [ ] Active learning (machine learning) - [ ] Online machine learning - [ ] Adversarial machine learning ### Neural networks & deep-learning building blocks · *forward-pass / backprop animator; toggle a neuron, push the gradient back* - [ ] Artificial neural network - [ ] [[Neural_network_(machine_learning)]] - [ ] Perceptron - [ ] Multilayer perceptron - [ ] Feedforward neural network - [ ] Backpropagation - [ ] Deep learning - [ ] Activation function - [ ] Sigmoid function - [ ] Softmax function - [ ] Rectifier (neural networks) - [ ] [[Convolution]] - [x] Convolutional neural network *✅ https://wikitube-3d-microsims.netlify.app/Convolutional_neural_network.html* - [ ] Batch normalization - [ ] Normalization (machine learning) - [ ] Weight initialization - [ ] Stochastic gradient descent - [ ] Data augmentation - [ ] Hyperparameter (machine learning) - [ ] Mechanistic interpretability ### Recurrent, sequence & memory architectures · *unrolled-network / state-cell animation; feed a sequence, watch the hidden state carry* - [ ] Recurrent neural network - [ ] Long short-term memory - [ ] Gated recurrent unit - [ ] Gating mechanism - [ ] Highway network - [ ] Residual neural network - [ ] Echo state network - [ ] Reservoir computing - [ ] Spiking neural network - [ ] Neural Turing machine - [ ] Differentiable neural computer - [ ] Mamba (deep learning architecture) ### Attention, transformers & embeddings · *attention-weight heatmap / embedding-space sim; query the keys, project the tokens* - [ ] Attention (machine learning) - [ ] Transformer (deep learning architecture) - [ ] Vision transformer - [ ] Word embedding - [ ] Large language model - [ ] Language model - [ ] Retrieval-augmented generation ### Generative & world models · *sample-from-noise / latent-walk animation; denoise the image, roll out the world model* - [ ] Generative model - [ ] Generative adversarial network - [ ] Autoencoder - [ ] Variational autoencoder - [ ] Boltzmann machine - [ ] Restricted Boltzmann machine - [ ] Diffusion model - [ ] Latent diffusion model - [ ] Diffusion process - [ ] Autoregressive model - [ ] World model (artificial intelligence) - [ ] U-Net - [ ] Graph neural network - [ ] Physics-informed neural networks - [ ] Topological deep learning - [ ] Multimodal learning ## I — Information theory Information theory is the mathematics of *surprise* — how much a message tells you, how tightly a source can be squeezed, and how much can be pushed through a noisy channel before errors swamp it. It is one of the most microsimmable branches in the hub, because every quantity *is* a picture a learner can drive: entropy is a bar that peaks when a distribution is flat and collapses when it spikes, mutual information is the overlap of two probability disks, a Huffman tree grows leaf-by-leaf as symbol weights are dragged, an arithmetic coder narrows an interval one symbol at a time, a binary symmetric channel flips bits at a rate you set, the sampling theorem rebuilds a [[Wave|wave]] from dots as you slide the rate past Nyquist, and a discrete cosine transform reconstructs an image block as you sweep its coefficients. Compression, coding, channels, and the entropy–[[Thermodynamics|thermodynamics]] bridge are all canvas-native. **226 articles** selected from the 609 validated candidates by the bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10 — the hub's richest coding pool, because the crawl swept the entire **Compression methods** navbox (Huffman, arithmetic and range coding, the LZ family, DCT and wavelet transforms, LPC speech coding, and motion-compensated video) on top of the core information-theory page. The pool was also heavily diluted, and the off-theme bulk was dropped rather than padded: the long roster of **people** (Shannon, Nyquist, Hartley, Kolmogorov, Wiener, Huffman, Boltzmann, Gibbs, and the entire **[[Cybernetics]]** navbox of theorists), **organizations / journals / books** (Bell Labs, IEEE, the *Bell System Technical Journal*, *A Mathematical Theory of Communication*, *Grammatical Man*), **named products, file formats and machines** (ZIP, Bzip2, LZMA, Zstd, Brotli, LZ4, the Compact Disc, the Enigma machine, the Voyager program), and the **areas-of-mathematics** navbox (Algebra, Topology, Number theory, Geometry … dropped wholesale as off-theme generic fields, exactly as the Optimization room did) along with the Informatics and broad-cybernetics fields, the neuroscience / linguistics / semiotics adjacencies, and the usual `Category:*`, `Template_talk:*`, `List_of_*`, `History_of_*`, `Timeline_of_*`, and `*_(identifier)` cruft. Synonym twins were collapsed to one slug each (Relative_entropy → `Kullback–Leibler_divergence`; Information entropy → `Entropy_(information_theory)`; Source_coding_theorem → `Shannon's_source_coding_theorem`; Shannon–Hartley_law → `Shannon–Hartley_theorem`; Self-information → `Information_content`; Base-2_logarithm → `Binary_logarithm`; Lossless_compression → `Lossless_data_compression`; Error-correction → `Error-correcting_code`). Probability and Markov machinery already built in the R room (Markov_chain, Monte_Carlo_method, Bayesian_network) was excluded as a within-page duplicate. ### Top 10 — start here (10) · *the canonical, most visual information-theory sims; build these first* - [ ] [[Entropy_(information_theory)]] - [ ] Mutual information - [ ] Huffman coding - [ ] Channel capacity - [ ] Kullback–Leibler divergence - [ ] Hamming distance - [ ] Arithmetic coding - [ ] Noisy-channel coding theorem - [ ] [[Nyquist–Shannon_sampling_theorem]] - [ ] Binary symmetric channel ### Entropy & information measures (22) · *entropy-meter / distribution-slider sim; drag the probabilities and watch H, I, and D move* - [ ] [[Differential_entropy]] - [ ] [[Conditional_entropy]] - [ ] [[Joint_entropy]] - [ ] Directed information - [ ] Conditional mutual information - [ ] Cross-entropy - [ ] Pointwise mutual information - [ ] Entropy rate - [ ] Information content - [ ] Binary entropy function - [ ] Rényi entropy - [ ] Tsallis entropy - [ ] Min-entropy - [ ] Asymptotic equipartition property - [ ] Limiting density of discrete points - [ ] Quantities of information - [ ] Redundancy (information theory) - [ ] Fisher information - [ ] Perplexity - [ ] Information fluctuation complexity - [ ] Pragmatic information - [ ] Fungible information ### Units of information (13) · *bit ↔ nat ↔ ban converter; set the log base and read the same quantity in every unit* - [ ] Bit - [ ] Byte - [ ] Shannon (unit) - [ ] [[Nat_(unit)]] - [ ] Hartley (unit) - [ ] Ban (unit) - [ ] Deciban - [ ] Binary logarithm - [ ] Natural logarithm - [ ] Common logarithm - [ ] E (mathematical constant) - [ ] Decimal digit - [ ] Sequence of symbols ### Channels, capacity & coding theorems (16) · *noisy-channel sim; push symbols through, flip bits, watch capacity bound the rate* - [ ] Shannon's source coding theorem - [ ] Shannon–Hartley theorem - [ ] Rate–distortion theory - [ ] [[Communication_channel]] - [ ] Channel code - [ ] Binary erasure channel - [ ] Gaussian channel - [ ] Gaussian noise - [ ] Broadcast channel - [ ] Relay channel - [ ] Communication source - [ ] Receiver (information theory) - [x] Signal (electrical engineering) *✅ https://wikitube-3d-microsims.netlify.app/Signal_%28electrical_engineering%29.html* - [ ] Network coding - [ ] Information rate - [ ] Covert channel ### Error detection & correction (3) · *parity / block-code sim; corrupt a bit and watch the code catch and repair it* - [ ] [[Error_detection_and_correction]] - [ ] Error-correcting code - [ ] Coding theory ### Entropy coding & lossless compression (21) · *code-tree builder; weight the symbols and grow the prefix-free codebook* - [ ] [[Data_compression]] - [ ] Lossless data compression - [ ] Entropy coding - [ ] Adaptive coding - [ ] Adaptive Huffman coding - [ ] Canonical Huffman code - [ ] Modified Huffman coding - [ ] Range coding - [ ] Asymmetric numeral systems - [ ] Shannon coding - [ ] Shannon–Fano coding - [ ] Shannon–Fano–Elias coding - [ ] Tunstall coding - [ ] Unary coding - [ ] Golomb coding - [ ] Exponential-Golomb coding - [ ] Elias gamma coding - [ ] Levenshtein coding - [ ] Universal code (data compression) - [ ] Prefix code - [ ] Run-length encoding ### Dictionary, transform & context compression (18) · *sliding-window / back-reference animation; match the dictionary and emit the token* - [ ] Dictionary coder - [ ] LZ77 and LZ78 - [ ] Lempel–Ziv–Welch - [ ] Lempel–Ziv–Storer–Szymanski - [ ] Byte-pair encoding - [ ] Deflate - [ ] Burrows–Wheeler transform - [ ] Move-to-front transform - [ ] Context tree weighting - [ ] Context mixing - [ ] Prediction by partial matching - [ ] Dynamic Markov compression - [ ] Delta encoding - [ ] Incremental encoding - [ ] Grammar-based code - [ ] Re-Pair - [ ] Sequitur algorithm - [ ] Smallest grammar problem ### Lossy compression, sampling & quantization (15) · *sample-and-quantize sim; set the rate, watch the staircase approximate the wave* - [ ] Lossy data compression - [ ] [[Sampling_(signal_processing)]] - [ ] [[Quantization_(signal_processing)]] - [ ] Quantization (image processing) - [ ] [[Companding]] - [ ] A-law algorithm - [ ] Μ-law algorithm - [ ] [[Delta_modulation]] - [ ] [[Differential_pulse-code_modulation]] - [ ] Adaptive differential pulse-code modulation - [x] [[Dynamic_range]] *✅ https://wikitube-3d-microsims.netlify.app/Dynamic_range.html* - [ ] Bit rate - [ ] Average bitrate - [ ] Constant bitrate - [ ] Variable bitrate ### Transforms & spectral coding (11) · *basis-projection visualizer; sweep the coefficients and rebuild the signal* - [ ] Transform coding - [ ] [[Discrete_cosine_transform]] - [ ] Modified discrete cosine transform - [ ] Discrete sine transform - [ ] Fourier transform - [ ] [[Fast_Fourier_transform]] - [ ] Wavelet transform - [ ] [[Discrete_wavelet_transform]] - [ ] Daubechies wavelet - [ ] Karhunen–Loève theorem - [ ] Lapped transform ### Speech & audio coding (10) · *source–filter vocal-tract sim; drive the LPC filter and watch the spectrum* - [ ] Linear predictive coding - [ ] Code-excited linear prediction - [ ] Algebraic code-excited linear prediction - [ ] Warped linear predictive coding - [ ] Log area ratio - [ ] Line spectral pairs - [ ] [[Speech_coding]] - [ ] Sub-band coding - [ ] Silence compression - [ ] Psychoacoustics ### Image & video coding (22) · *block / motion-vector sim; split into macroblocks and track motion across frames* - [ ] Color space - [ ] Chroma subsampling - [ ] Macroblock - [ ] Pixel - [ ] Image resolution - [ ] Display resolution - [ ] Peak signal-to-noise ratio - [ ] Compression artifact - [ ] Chain code - [ ] Fractal compression - [ ] Pyramid (image processing) - [ ] Embedded zerotrees of wavelet transforms - [ ] Set partitioning in hierarchical trees - [ ] Coding tree unit - [ ] Texture compression - [ ] Frame rate - [ ] Video compression picture types - [ ] Interlaced video - [ ] Deblocking filter - [ ] Motion compensation - [ ] Motion estimation - [ ] Motion vector ### Compressed data structures (3) · *succinct-index sim; query the compressed structure in place* - [ ] Compressed data structure - [ ] Compressed suffix array - [ ] FM-index ### Cryptography & randomness (19) · *cipher / entropy-source sim; key the stream, measure the unicity distance* - [ ] Cryptographic algorithm - [ ] Code (cryptography) - [ ] Cipher - [ ] Cryptanalysis - [ ] Public-key cryptography - [ ] Symmetric-key algorithm - [ ] Block cipher - [ ] One-time pad - [ ] Key (cryptography) - [ ] Information theoretic security - [ ] Unicity distance - [ ] Plaintext - [ ] Ciphertext - [ ] Brute force attack - [ ] Encoding - [ ] Pseudorandom number generator - [ ] Cryptographically secure pseudorandom number generator - [ ] Random seed - [ ] Extractor (mathematics) ### Algorithmic information & complexity (13) · *program-length sim; compress the string toward its Kolmogorov bound* - [ ] Algorithmic information theory - [ ] Kolmogorov complexity - [ ] Algorithmic probability - [ ] Minimum message length - [ ] Minimum description length - [ ] Inductive probability - [ ] Info-metrics - [ ] Information geometry - [ ] Information algebra - [ ] Information field theory - [ ] Information theory and measure theory - [ ] Logic of information - [ ] Quantum information science ### Probability foundations for information (21) · *distribution / Bayes-update sim; sample the variable and update the posterior* - [ ] Probability mass function - [ ] Probability distribution - [ ] Discrete random variable - [x] [[Expected_value]] *✅ https://wikitube-3d-microsims.netlify.app/Expected_value.html* - [ ] Bernoulli trial - [ ] Independent and identically distributed - [ ] Statistical independence - [ ] Conditional probability - [ ] Prior probability - [ ] Posterior probability - [ ] Bayesian inference - [ ] Likelihood-ratio test - [ ] Multinomial distribution - [ ] Pearson's chi-squared test - [ ] Stochastic process - [ ] Stationary process - [ ] Ergodic theory - [ ] Memoryless - [ ] Error exponents in hypothesis testing - [ ] [[Detection_theory]] - [ ] [[Estimation_theory]] ### Information in physics, mind & systems (9) · *entropy-bridge / feedback sim; couple microstates, rewards, and control loops* - [ ] Entropy in thermodynamics and information theory - [ ] Integrated information theory - [ ] Free energy principle - [ ] Bayesian brain - [ ] Gambling and information theory - [ ] [[Catastrophe_theory]] - [ ] [[Emergence]] - [ ] [[Homeostasis]] - [ ] [[Decision_theory]] ## T — Theory of computation Theory of computation asks what can be computed at all, and at what cost — the machines that recognize languages, the problems no machine can decide, and the classes that sort the solvable by time and space. It is crisply microsimmable because every model *is* a machine a learner can step: a Turing machine scans and rewrites its tape one square at a time, a finite automaton lights up states as a string is fed in, a pushdown automaton pushes and pops a stack, a lambda term β-reduces one redex per click, a regular expression compiles into an automaton you can watch match, and a Big-O curve races two runtimes as the input grows. The Chomsky [[Hierarchy|hierarchy]] nests as four boxes, and the halting problem assembles its diagonal contradiction line by line. **32 articles** selected from the 74 validated candidates — the hub's second-smallest pool — by the bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. The narrow `Theory_of_computation` crawl was mostly **people, prizes, and textbooks** rather than concepts, all dropped rather than padded: the founders and authors (Church, Gödel, Kleene, Péter, Cook, Rabin, Hopcroft, Ullman, Sipser, Davis, Motwani, Rogers, Cooper, Llull), the **prizes and venues** (Turing Award, Gödel Prize, Knuth Prize, IMU Abacus Medal, the Millennium Prize Problems, the Clay Mathematics Institute, FOCS and STOC), the **canonical textbooks** (*Introduction to Automata Theory, Languages, and Computation*; *Introduction to the Theory of Computation*), the **universities and presses** (MIT, Harvard, Princeton University Press), and the usual `Category:*` cruft. Cross-room twins were routed to their owning branch rather than duplicated here: Decidability_(logic) and Quantification_theory live in the [[Logic|L]] room, Finite-state automaton / Finite automata are the [[Computer_architecture|A]] room's Finite-state_machine, and Approximation_algorithms belongs to the [[Mathematical_optimization|O]] room. Synonym twins were collapsed to one slug each (P_=_NP_problem → `P_versus_NP_problem`; Primitive_recursion → `Primitive_recursive_function`). ### Top 10 — start here (10) · *the canonical, most visual theory-of-computation sims; build these first* - [ ] Turing machine - [ ] Halting problem - [ ] Pushdown automaton - [ ] Chomsky hierarchy - [ ] P.O.E.T.I.C.S./Iconography/POETICS Iconography Registry/Systems/big o notation - [ ] P versus NP problem - [ ] Lambda calculus - [ ] Regular expressions - [ ] Time complexity - [ ] Context-free grammar ### Automata & formal languages (6) · *automaton-stepping sim; feed a string, walk the states, accept or reject* - [ ] Recursively enumerable language - [ ] Context-sensitive grammar - [ ] Linear bounded automaton - [ ] Regular grammar - [ ] Alphabet (formal languages) - [ ] String (computer science) ### Computability, undecidability & self-reference (4) · *diagonalization / reduction sim; assemble the contradiction, reduce one problem to another* - [ ] Church–Turing thesis - [ ] Rice's theorem - [ ] Recursion theory - [ ] Gödel numbering ### Lambda calculus & combinators (3) · *reduction-step animator; click a redex and watch the term shrink* - [ ] Beta reduction - [ ] Combinatory logic - [ ] Function composition (computer science) ### Recursive functions & rewriting machines (6) · *machine-trace / string-rewrite sim; step the register machine, apply the production* - [ ] Μ-recursive function - [ ] Primitive recursive function - [ ] Markov algorithm - [ ] String rewriting system - [ ] Register machine - [ ] Program semantics ### Complexity classes & asymptotics (3) · *growth-curve / class-hierarchy sim; race the runtimes, nest P inside NP* - [ ] Space complexity - [ ] Asymptotic analysis - [ ] NP (complexity) ## H — Hardware > ⚠️ **Under-seeded — disambiguation-page mis-crawl (the same fault that was fixed for A).** The sheet's **H** parent was `/wiki/Hardware`, the *general* "hardware" **disambiguation page** — not `/wiki/Computer_hardware`. Of its 33 links, all but four are non-computer senses of the word: household, builders', drum and music hardware, military *materiel*, medals and trophies, a hardware *store*, the films / TV series / band / albums named "Hardware", the novelist Robert Silverberg, the village of Hardware, Virginia, and three `Category:*disambiguation*` pages. Only **4** are genuine computer-hardware concepts — and the digital-logic sims this room was meant to hold (logic gates, adders, multiplexers, flip-flops, registers, the clock, buses and memory) were already mined into the re-crawled **[[Computer_architecture|A — Architecture]]** branch, with `Hardware_acceleration` excluded here as a within-page duplicate of that room. **Recommended fix: a live re-crawl of `Computer_hardware`** (motherboard, CPU, RAM, storage, GPU, I/O, buses, peripherals, power, cooling), exactly as `Computer_architecture` re-seeded A — or fold H into the A — Architecture room. Computer hardware is the physical machine — the chips, boards, buses, memory and network devices that carry out the logical design described in the [[Computer_architecture|Architecture]] room. It is densely microsimmable in principle: a logic family is a truth table you toggle, a component is a part you wire on a breadboard, a network is a graph of switches you route packets through, and a whole computer is a labelled block diagram you clock. The four concepts below carry that promise; the remainder of the room awaits a `Computer_hardware` re-crawl. **4 articles** selected from the 33 validated candidates — by far the hub's thinnest yield, because the parent was a disambiguation page rather than a topic page (so this branch is flagged `⚠️ under-seeded` rather than padded with off-theme links). Dropped, 29 in all: the five disambiguation / `Category:*` pages (`Hardware`, `Ware_(disambiguation)`, and the three `Category:*_disambiguation_pages`); ten non-computer senses of "hardware" (`Household_hardware`, `Builders_hardware`, `Hardware_(development_cooperation)`, `Drum_hardware`, `Music_hardware`, `Hardware_store`, `Materiel`, `Medal`, `Trophies`, `Military_technology`); nine named works / people / places (`Hardware_(Krokus_album)`, `Hardware_(Billy_Gibbons_album)`, `Hardware_(band)`, `Hardware_(character)`, `Hardware_(film)`, `Hardware_(TV_series)`, `Hardware:_Online_Arena`, `Robert_Silverberg`, `Hardware,_Virginia`); the broad field `Hardware_engineering` and the `Open-source_hardware` / `Open-source_software` movements; the near-twin `Electronic_hardware` (collapsed into `Electronic_component`); and `Hardware_acceleration`, reserved to the A — Architecture room as a within-page duplicate. ### Start here (4) · *the genuine computer-hardware concepts in this pool — label-the-component / toggle-the-logic / route-the-packet sims* - [x] [[Computer_hardware]] *✅ https://wikitube-3d-microsims.netlify.app/Computer_hardware.html* - [ ] Digital electronics - [ ] Electronic component - [ ] Networking hardware > *Filler pass (this run): re-extracted the 33-row `Hardware` candidate pool (col-A parent `/wiki/Hardware`) and removed the 4 already-listed slugs. The 29-item remainder contains **0 new qualifying microsim concepts** — it is entirely the disambiguation-page material already documented above: three `Category:*disambiguation*` pages plus the `Hardware` and `Ware_(disambiguation)` stubs; ten non-computer senses of "hardware" (`Household_hardware`, `Builders_hardware`, `Drum_hardware`, `Music_hardware`, `Hardware_store`, `Hardware_(development_cooperation)`, `Materiel`, `Medal`, `Trophies`, `Military_technology`); nine named works / people / places (`Hardware_(Krokus_album)`, `Hardware_(Billy_Gibbons_album)`, `Hardware_(band)`, `Hardware_(character)`, `Hardware_(film)`, `Hardware_(TV_series)`, `Hardware:_Online_Arena`, `Robert_Silverberg`, `Hardware,_Virginia`); the broad field `Hardware_engineering` and the `Open-source_hardware` / `Open-source_software` movements; and synonyms / within-page duplicates of already-placed items (`Electronic_hardware` → `Electronic_component`; `Hardware_acceleration` — the lone technically-microsimmable candidate — reserved to the [[Computer_architecture|A — Architecture]] room). The CSV pool is exhausted of genuine computer-hardware microsim concepts; the documented fix — a live re-crawl of `Computer_hardware` (motherboard, CPU, RAM, storage, GPU, I/O, buses, peripherals, power, cooling), exactly as `Computer_architecture` re-seeded A — is outside this CSV-based filler loop and remains the recommended way to thicken this branch past 4. Branch marked ·filled at 4 ⚠️ under-seeded.* ## M — Machine learning Machine learning builds models that improve with data — fitting a function to examples, drawing a decision boundary between classes, clustering points by similarity, or reducing a high-dimensional cloud to the few directions that matter. It is among the most microsimmable branches in the hub: a regression line tilts to minimise its residuals as you drag the points, a support-vector machine widens its margin and bends under a kernel, a decision tree grows split by split, k-means centroids chase their clusters, a Gaussian process draws a shaded confidence band that pinches at the data, the bias–variance trade-off bows as model complexity rises, and a genetic algorithm breeds a population toward fitness. Loss curves, ROC curves, decision boundaries, manifolds and feature spaces are all canvas-native. **125 articles** selected from the 454 validated candidates — the hub's second-largest pool — by the bar *"can this be shown as an effective interactive MicroSim?"*, grouped by p5.js pattern and led by a build-first top-10. To keep the two learning rooms distinct, the *deep* neural-network, sequence, attention and generative machinery (perceptron, MLP, backpropagation, CNN/RNN/LSTM, transformers, autoencoders, GANs, diffusion) lives in the **[[Reinforcement_learning|R — Reinforcement learning]]** room, which had reserved this room's **classical statistical-ML signature** — regression, kernels and SVMs, decision trees and ensembles, clustering and manifolds, sparse coding, Bayesian models, evolutionary search, feature engineering, and model evaluation — for here. The pool was crawled from the broad **`machine_learning`** page, so it was heavily diluted and the off-theme bulk was dropped rather than padded: ~60 **software toolkits and products** (PyTorch, TensorFlow, scikit-learn, Keras, Weka, XGBoost, MATLAB, SAS, KNIME, RapidMiner, the Apache stack, the cloud ML services …), ~30 **people** (Samuel, Breiman, Bishop, Friedman, Hastie, Tibshirani, Cortes, Norvig, Russell, Mitchell, Rumelhart, Hebb …), the **journals, conferences, presses and prizes** (the NeurIPS/ICML-class venues, *Nature Machine Intelligence*, IEEE TPAMI, ArXiv, the Netflix Prize …), the **AI-ethics, safety and controversy** pages (algorithmic harms, deepfake scandals, open letters, the OpenAI governance saga …), narrow **deployment domains** (precision agriculture, autonomous cars, ML in physics / [[Earth|earth]]-science / [[Bioinformatics|bioinformatics]] …), and the usual `Category:*`, `List_of_*`, `Template_talk:*`, and `*_(identifier)` cruft. Synonym/twins were collapsed or routed to their owning room (Bayesian_optimisation, Mathematical_optimisation, Simulation-based_optimisation → the [[Mathematical_optimization|O]] room; Fuzzy_logic → the [[Logic|L]] room's Fuzzy_logics; Genetic_algorithm → O's Genetic_algorithms; Posterior_probabilities → I's Posterior_probability; Feature_space_vector → Feature_vector). **Gap note:** this crawl's validated links did *not* include the canonical named classifiers — `Random_forest`, `K-means_clustering`, `Principal_component_analysis`, `Naive_Bayes_classifier`, `Logistic_regression`, `k-nearest_neighbors`, `Gradient_boosting` — so a follow-up re-crawl of `Outline_of_machine_learning` is recommended to seed those flagship sims. ### Top 10 — start here (10) · *the most canonical, visually striking ML sims; build these first* - [ ] Decision tree - [ ] Support-vector machine - [ ] Decision boundary - [ ] Gaussian processes - [ ] Manifold learning - [ ] Bias–variance decomposition - [ ] Ordinary least squares - [ ] Centroid - [ ] Kernel trick - [ ] Ensemble methods ### Regression & linear models (8) · *least-squares line/curve-fit sim; drag the points and watch the fit tilt to minimise the residuals* - [ ] Polynomial regression - [ ] Ridge regression - [ ] Kernel regression - [ ] General linear model - [ ] Generalised linear model - [ ] Errors and residuals - [ ] Basis function - [ ] [[Time_series]] ### Classification & decision rules (9) · *decision-boundary / tree-split sim; move a point and watch the predicted class flip* - [ ] Classification - [ ] Binary classifier - [ ] Linear classifier - [ ] Probabilistic classification - [ ] Tree-based models - [ ] Platt scaling - [ ] Predictive modeling - [ ] Syntactic pattern recognition - [ ] Leaf node ### Model evaluation, error & learning theory (9) · *learning-curve / ROC / bias-variance sim; trade complexity against generalisation* - [ ] Empirical risk minimisation - [ ] Model selection - [x] Sensitivity and specificity *✅ https://wikitube-3d-microsims.netlify.app/Sensitivity_and_specificity.html* - [ ] False positive rate - [ ] False negative rate - [ ] Uncertainty quantification - [ ] Outlier - [ ] Ensemble Averaging - [ ] Bootstrapping (statistics) ### Unsupervised learning, clustering & manifolds (9) · *cluster-and-embed sim; group the points, then unroll the manifold* - [ ] Unsupervised machine learning - [ ] Manifold hypothesis - [ ] Manifold regularisation - [ ] Multilinear subspace learning - [ ] Manifold - [ ] Similarity learning - [ ] Topic model - [ ] Market basket analysis - [ ] Sequence mining ### Sparse coding, dictionaries & matrix factorisation (6) · *atoms-and-codes sim; reconstruct the signal from a sparse set of basis atoms* - [ ] Dictionary learning - [ ] Sparse coding - [ ] K-SVD - [ ] Sparse matrix - [ ] Matrix decomposition - [ ] Knowledge graph embedding ### Features, data & representation (11) · *feature-space / train–test-split sim; extract features and watch the sample partition* - [ ] Feature (machine learning) - [x] Feature extraction *✅ https://wikitube-3d-microsims.netlify.app/Feature_extraction.html* - [ ] Feature vector - [ ] Labeled data - [ ] Training data - [ ] Test set - [ ] Synthetic data - [ ] Exploratory data analysis - [ ] Data quality - [ ] Data analysis - [ ] Big data ### Probabilistic & Bayesian models (11) · *distribution / graphical-model sim; sample the variables and propagate belief* - [ ] Covariance function - [ ] Multivariate normal distribution - [ ] Conditional independence - [ ] Dynamic Bayesian network - [ ] Influence diagram - [ ] Probabilistic reasoning - [ ] Random variables - [ ] Sample (statistics) - [ ] Dempster–Shafer theory - [ ] Imprecise probability - [ ] Possibility theory ### Evolutionary & bio-inspired learning (5) · *evolving-population sim; select, cross over and mutate toward fitness* - [ ] Chromosome (genetic algorithm) - [ ] Crossover (genetic algorithm) - [ ] Mutation (genetic algorithm) - [ ] Artificial immune system - [ ] Learning classifier system ### Neural roots & model efficiency (9) · *single-neuron / prune-and-distil sim; fire the neuron, then shrink the network* - [ ] ADALINE - [ ] Artificial neuron - [ ] Hebbian theory - [ ] Deep neural network - [ ] Biological neural network - [ ] Physical neural network - [ ] Pruning (artificial neural network) - [ ] Knowledge distillation - [ ] Model compression ### Optimisation, structures & distributed learning (9) · *hyperparameter-search / computation-graph sim; tune, differentiate, and federate* - [ ] Hyperparameter optimisation - [ ] Federated learning - [ ] Differentiable programming - [ ] Machine unlearning - [ ] Weak supervision - [ ] Directed acyclic graph - [x] [[Tensor]] *✅ https://wikitube-3d-microsims.netlify.app/Tensor.html* - [ ] Array data structure - [ ] Search algorithm ### Applications I — perception, language & vision (8) · *task sims; recommend, translate, denoise, classify sentiment* - [ ] [[Recommender_system]] - [ ] Sentiment analysis - [ ] Machine translation - [ ] Natural-language understanding - [x] Machine perception *✅ https://wikitube-3d-microsims.netlify.app/Machine_perception.html* - [ ] Image denoising - [ ] Tomographic reconstruction - [ ] Affective computing ### Applications II — agents, control & mining (9) · *agent / pattern-mining sim; learn a policy, mine a stream, flag the anomaly* - [ ] Robot learning - [ ] General game playing - [ ] Machine learning control - [ ] Intrusion detection - [ ] Web usage mining - [ ] Ranking - [ ] Social network - [ ] Model collapse - [ ] Medical diagnosis ### Fairness, bias & higher-level concepts (7) · *audit / paradigm sim; probe the model for biased decisions and frame the learning problem* - [ ] Algorithmic bias - [ ] Fairness (machine learning) - [ ] Automated decision-making - [ ] Symbolic AI - [ ] Knowledge discovery - [ ] AIXI - [ ] Solomonoff's theory of inductive inference ### More — filler pass (5) · *additional microsimmable ML/AI concepts surfaced on a second pass of the 454-link pool; the rest of the remainder was people, software/products, journals, conferences, controversy pages, deployment domains, and biology — dropped per the room's drops* - [x] Image processing *✅ https://wikitube-3d-microsims.netlify.app/Image_processing.html* - [ ] Inductive logic programming - [ ] Inductive programming - [ ] Turing test - [ ] Chinese room --- ## How to use this worklist 1. **Lease the branch.** `python3 ../MicroSim-Registry/microsim_registry.py branch-acquire --page Algorithm --branch "<Letter> — <Name>"`. 2. **Populate it** per `../MicroSim-Registry/BRANCH-BUILD-METHOD.md` (flipped columns). Drop named software, companies, languages, people, and products; keep algorithms, data structures, models, methods, and the named theorems/effects with a canonical animation. Group by pattern with a build-first top-10. 3. **Build, register & release.** `scan --write`, then `branch-release --built`. `check` is the collision gate. ```dataview TABLE status, editor_url FROM "Articles" WHERE contains(file.folder, "Algorithm") SORT status ``` --- _Seed: the **A.L.G.O.R.I.T.H.M.** sheet (4,472 validated links) · all 9 branches built/queued (A re-crawled from Computer_architecture) · one article per topic enforced vault-wide by MicroSim-Registry._ --- <!-- HYDRO-BRIDGE:START --> ## 🌊 Hydrodynamics image bridges (8) *Back-links from the Hydrodynamics Image Atlas — the 8 water images that bridge into **ALGORITHM**. The atlas forward-links this hub; these are the return path. The Water Room is the corpus's most interconnected node.* - №33 · Lorenz attractor - №34 · Finite-volume mesh - №35 · Turbulence model (LES/RANS) - №36 · Navier–Stokes Millennium Problem - №37 · Spectral method (FFT flow) - №38 · Lattice-gas cellular automaton - №39 · Hydrodynamic stability (eigenvalue) analysis - №40 · Adaptive mesh refinement Parent flow: Hydrodynamics Portal · Image Atlas (100) · Water Room. <!-- HYDRO-BRIDGE:END --> <!-- BEAUTY-PASS-MEDIA:START --> <!-- CRAFT-LINK:START g12 --> *Built to the [[WT!Three_js_Microsim_Master_Class|three.js Master Class]].* <!-- CRAFT-LINK:END --> ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Algorithm) : [Wikitube](https://en.wikitube.io/wiki/Algorithm) ## Previous hub tags Tree parents: [[Agent-based_model]] · [[Decision_theory]] · [[Game_theory]] · [[Graph_theory]] · [[Information_theory]] · [[Monte_Carlo_method]] · [[Reliability_engineering]] · [[Systems_engineering]]. Legacy hubs: `ALGORITHM`. --- *Sources: 2 legacy notes. Minted wave 1, 2026-07-30 (v1.6 order).*