{"https://codexery.com/sets-and-logic/e/sets-and-logic/set-mathematics/": {"t": "Set (mathematics)", "s": "A set is a collection of different things, typically mathematical objects."}, "/e/complexity-theory/time-complexity/": {"t": "Time complexity", "s": "A measure of algorithm running time as input size grows."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/turing-machine/": {"t": "Turing machine", "s": "Abstract machine model that can implement any computer algorithm."}, "/e/complexity-theory/nondeterministic-turing-machine/": {"t": "Nondeterministic Turing machine", "s": "A computation model with multiple possible actions per state."}, "/e/complexity-theory/p-complexity/": {"t": "P (complexity)", "s": "Complexity class of polynomial-time solvable decision problems."}, "/e/complexity-theory/p-versus-np-problem/": {"t": "P versus NP problem", "s": "A major unsolved problem in theoretical computer science."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/np-completeness/": {"t": "NP-completeness", "s": "Hardest problems in NP, central to P versus NP."}, "https://codexery.com/computing-digital/e/computing-and-digital/computer-science/": {"t": "Computer science", "s": "Study of computation, information, and automation spanning theory to application."}, "https://codexery.com/sets-and-logic/e/sets-and-logic/union-set-theory/": {"t": "Union (set theory)", "s": "Set operation combining all elements from given sets."}, "https://codexery.com/set-theory-and-foundations/e/set-theory-and-foundations/complement-set-theory/": {"t": "Complement (set theory)", "s": "Set of elements not in a given set."}, "/e/complexity-theory/time-hierarchy-theorem/": {"t": "Time hierarchy theorem", "s": "Time hierarchy theorems show more time yields more solvable problems."}, "https://codexery.com/set-theory-logic/e/set-theory-and-logic/propositional-logic/": {"t": "Propositional logic", "s": "Branch of classical logic dealing with propositions and logical connectives."}, "/e/complexity-theory/travelling-salesman-problem/": {"t": "Travelling salesman problem", "s": "A classic NP-hard problem in combinatorial optimization."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/binary-search/": {"t": "Binary search", "s": "Efficient search algorithm for sorted arrays."}, "/e/complexity-theory/np-complexity/": {"t": "NP (complexity)", "s": "Class of decision problems verifiable in polynomial time."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/halting-problem/": {"t": "Halting problem", "s": "No algorithm can decide if any program halts."}, "https://codexery.com/algebra/e/algebra/polynomial/": {"t": "Polynomial", "s": "A mathematical expression of variables and coefficients using addition and multiplication."}, "https://codexery.com/rules-of-thumb/e/rules-of-thumb/rule-of-thumb/": {"t": "Rule of thumb", "s": "A practical approximation method, not a legal doctrine."}, "https://codexery.com/scottish-inventions/e/scottish-inventions/logarithm/": {"t": "Logarithm", "s": "The inverse operation of exponentiation, simplifying multiplication into addition."}, "https://codexery.com/mathematics-and-cryptography/e/mathematics-and-cryptography/stephen-cook/": {"t": "Stephen Cook", "s": "University Professor Emeritus, recipient of the A.M. Turing Award for formalizing NP-completeness."}, "/e/complexity-theory/theoretical-computer-science/": {"t": "Theoretical computer science", "s": "Study of abstract and mathematical foundations of computation."}, "/e/complexity-theory/theory-of-computation/": {"t": "Theory of computation", "s": "Study of computability, complexity, and models of computation."}, "https://codexery.com/philosophical-concepts/e/philosophical-concepts/determinism/": {"t": "Determinism", "s": "The view that all events occur in only one possible way."}, "https://codexery.com/historical-figures/e/scientists/alan-turing/": {"t": "Alan Turing", "s": "Father of theoretical computer science and codebreaker who helped defeat the Nazis."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/breadth-first-search/": {"t": "Breadth-first search", "s": "Algorithm exploring nodes level by level using a queue."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/algorithm/": {"t": "Algorithm", "s": "A finite sequence of logical instructions for solving problems."}, "https://codexery.com/computing-software/e/computing-and-software/parallel-computing/": {"t": "Parallel computing", "s": "Parallel computing enables simultaneous processing of divided tasks."}, "https://codexery.com/combinatorics/e/combinatorics/recurrence-relation/": {"t": "Recurrence relation", "s": "Equation defining sequence terms from previous ones."}, "/e/complexity-theory/sorting-algorithm/": {"t": "Sorting algorithm", "s": "Algorithm that reorders list elements into a specified order."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/abstract-machine/": {"t": "Abstract machine", "s": "Theoretical model for analyzing computer system functions."}, "https://codexery.com/science-measurement/e/science-and-measurement/machine-learning/": {"t": "Machine learning", "s": "Statistical algorithms that learn from data without explicit programming."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/depth-first-search/": {"t": "Depth-first search", "s": "Algorithm exploring branches fully before backtracking."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/universal-turing-machine/": {"t": "Universal Turing machine", "s": "A Turing machine that can simulate any other Turing machine."}, "https://codexery.com/set-theory-and-foundations/e/set-theory-and-foundations/cantor-s-diagonal-argument/": {"t": "Cantor's diagonal argument", "s": "Proof that some infinities are larger than others."}, "https://codexery.com/economic-concepts/e/economic-concepts/economics/": {"t": "Economics", "s": "Social science studying production, distribution, and consumption of goods and services.", "i": "https://codexery.com/economic-concepts/img/economic-concepts/economics.webp", "c": "Pk0001 · CC BY-SA 4.0"}, "https://codexery.com/card-tabletop-games/e/card-and-tabletop-games/sudoku/": {"t": "Sudoku", "s": "Logic puzzle where each row, column, and box contains digits 1–9."}, "https://codexery.com/mathematicians/e/mathematicians/john-forbes-nash-jr/": {"t": "John Forbes Nash Jr.", "s": "American mathematician who revolutionized game theory and differential geometry."}, "https://codexery.com/scientists-and-mathematicians/e/scientists-and-mathematicians/kurt-g-del/": {"t": "Kurt Gödel", "s": "Logician who proved limits of formal axiomatic systems."}, "https://codexery.com/mathematicians/e/mathematicians/john-von-neumann/": {"t": "John von Neumann", "s": "Mathematician who shaped quantum physics, computing, and nuclear strategy."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/automata-theory/": {"t": "Automata theory", "s": "Study of abstract machines and solvable computational problems."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/computability-theory/": {"t": "Computability theory", "s": "Study of computable functions and degrees of noncomputability."}, "https://codexery.com/philosophical-concepts/e/philosophical-concepts/abstraction/": {"t": "Abstraction", "s": "The process of generalizing rules and concepts from specific examples.", "i": "https://codexery.com/philosophical-concepts/img/philosophical-concepts/abstraction.webp", "c": "Simon Pierre Barrette ( Cephas ( talk )) · CC BY-SA 4.0"}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/decidability-logic/": {"t": "Decidability (logic)", "s": "Decidability concerns effective methods for logical membership."}, "https://codexery.com/philosophers-and-logicians/e/philosophers-and-logicians/ramon-llull/": {"t": "Ramon Llull", "s": "Inventor of a combinatorial logical system to prove Christian doctrine."}, "https://codexery.com/computer-scientists-and-programmers/e/computer-scientists-and-programmers/alonzo-church/": {"t": "Alonzo Church", "s": "Founder of computer science and inventor of lambda calculus."}, "https://codexery.com/pioneers-of-computing-and-information-th/e/pioneers-of-computing-and-information-theory/claude-shannon/": {"t": "Claude Shannon", "s": "Polymath who founded information theory and digital circuit design.", "i": "https://codexery.com/pioneers-of-computing-and-information-th/img/pioneers-of-computing-and-information-theory/claude-shannon.webp", "c": "via Wikipedia: Claude Shannon · see source"}, "https://codexery.com/set-theory-logic/e/set-theory-and-logic/rice-s-theorem/": {"t": "Rice's theorem", "s": "All non-trivial semantic properties of programs are undecidable."}, "https://codexery.com/historical-figures/e/notable/noam-chomsky/": {"t": "Noam Chomsky", "s": "Father of modern linguistics and influential political critic."}, "https://codexery.com/computing-digital/e/computing-and-digital/computer-network/": {"t": "Computer network", "s": "A system of interconnected hosts communicating via protocols and hardware."}, "https://codexery.com/computing-digital/e/computing-and-digital/computing/": {"t": "Computing", "s": "Goal-oriented activity involving computing machinery and algorithmic processes."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/finite-state-machine/": {"t": "Finite-state machine", "s": "A finite-state machine models computation with a finite number of states."}, "/e/complexity-theory/quicksort/": {"t": "Quicksort", "s": "Efficient divide-and-conquer sorting algorithm developed by Tony Hoare."}, "/e/complexity-theory/search-algorithm/": {"t": "Search algorithm", "s": "Algorithms designed to solve search problems in data structures."}, "https://codexery.com/computer-scientists-and-programmers/e/computer-scientists-and-programmers/betty-holberton/": {"t": "Betty Holberton", "s": "ENIAC programmer who invented breakpoints and the first program that wrote a program.", "i": "https://codexery.com/computer-scientists-and-programmers/img/computer-scientists-and-programmers/betty-holberton.webp", "c": "via Wikipedia: Betty Holberton · see source"}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/divide-and-conquer-algorithm/": {"t": "Divide-and-conquer algorithm", "s": "Recursively breaks problems into simpler sub-problems and combines solutions."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/heap-data-structure/": {"t": "Heap (data structure)", "s": "Tree-based data structure satisfying the heap property."}, "https://codexery.com/mathematical-logic-and-computation/e/mathematical-logic-and-computation/analysis-of-algorithms/": {"t": "Analysis of algorithms", "s": "Study of resource usage in algorithm execution."}, "https://codexery.com/computing-digital/e/computing-and-digital/android-operating-system/": {"t": "Android (operating system)", "s": "The world's most widely used operating system, powering billions of devices."}, "https://codexery.com/python/e/python/python-programming-language/": {"t": "Python (programming language)", "s": "High-level, general-purpose language emphasizing readability and simplicity."}, "https://codexery.com/pioneers-of-computing-and-information-th/e/pioneers-of-computing-and-information-theory/niklaus-wirth/": {"t": "Niklaus Wirth", "s": "Swiss computer scientist who designed several programming languages, including Pascal.", "i": "https://codexery.com/pioneers-of-computing-and-information-th/img/pioneers-of-computing-and-information-theory/niklaus-wirth.webp", "c": "Tyomitch · via Wikipedia: Niklaus Wirth · Copyrighted free use"}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/merge-sort/": {"t": "Merge sort", "s": "A stable, divide-and-conquer sorting algorithm invented by John von Neumann."}, "https://codexery.com/mathematics-and-cryptography/e/mathematics-and-cryptography/tony-hoare/": {"t": "Tony Hoare", "s": "British computer scientist; developed quicksort and Hoare logic."}, "https://codexery.com/universities/e/universities/moscow-state-university/": {"t": "Moscow State University", "s": "Russia's oldest university, a center of learning and controversy.", "i": "https://codexery.com/universities/img/universities/moscow-state-university.webp", "c": "Suicasmo · CC BY-SA 4.0"}, "https://codexery.com/named-stars/e/named-stars/algol/": {"t": "Algol", "s": "A bright multiple star and prototype of Algol variables."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/binary-search-tree/": {"t": "Binary search tree", "s": "Binary search tree: ordered binary tree for fast lookup."}, "https://codexery.com/probability-and-stochastic-processes/e/probability-and-stochastic-processes/random-variable/": {"t": "Random variable", "s": "A measurable function from sample space to measurable space."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/linked-list/": {"t": "Linked list", "s": "A data structure where each node points to the next."}, "https://codexery.com/computer-storage/e/computer-storage/disk-storage/": {"t": "Disk storage", "s": "Rotating-disk data storage using magnetic, optical, or mechanical recording."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/hash-table/": {"t": "Hash table", "s": "A data structure mapping keys to values via hash functions."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/brute-force-search/": {"t": "Brute-force search", "s": "A problem-solving method checking all possible candidates."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/gradient-descent/": {"t": "Gradient descent", "s": "First-order iterative algorithm for minimizing differentiable multivariate functions."}, "https://codexery.com/boardgames/e/board-games/chess/": {"t": "Chess", "s": "The timeless game of strategy and intellect."}, "https://codexery.com/boardgames/e/board-games/backgammon/": {"t": "Backgammon", "s": "The classic two-player game of strategy and luck, descended from 16th-century Irish.", "i": "https://codexery.com/boardgames/img/board-games/backgammon.webp", "c": "Thomas Rowlandson · CC0"}, "https://codexery.com/economic-concepts/e/economic-concepts/finance/": {"t": "Finance", "s": "Finance manages money, investments, and financial systems."}, "https://codexery.com/violence-conflict/e/violence-and-conflict/military/": {"t": "Military", "s": "A heavily armed, highly organized force for warfare.", "i": "https://codexery.com/violence-conflict/img/violence-and-conflict/military.webp", "c": "Solomon203 · CC BY-SA 3.0"}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/dijkstra-s-algorithm/": {"t": "Dijkstra's algorithm", "s": "Algorithm for shortest paths in weighted graphs."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/kruskal-s-algorithm/": {"t": "Kruskal's algorithm", "s": "Greedy algorithm for minimum spanning trees using sorted edges."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/greedy-algorithm/": {"t": "Greedy algorithm", "s": "Algorithm making locally optimal choices without reconsidering past decisions."}, "https://codexery.com/historical-figures/e/scientists/edsger-w-dijkstra/": {"t": "Edsger W. Dijkstra", "s": "Dutch computer scientist and pioneer of structured programming"}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/maximum-flow-problem/": {"t": "Maximum flow problem", "s": "Problem of maximizing flow through a network from source to sink."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/ford-fulkerson-algorithm/": {"t": "Ford–Fulkerson algorithm", "s": "Greedy algorithm for maximum flow in a network."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/minimum-cost-flow-problem/": {"t": "Minimum-cost flow problem", "s": "Optimization problem to send flow at minimum cost."}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/max-flow-min-cut-theorem/": {"t": "Max-flow min-cut theorem", "s": "Maximum flow equals minimum cut capacity in a network."}, "https://codexery.com/mathematicians/e/mathematicians/george-dantzig/": {"t": "George Dantzig", "s": "American mathematical scientist who developed the simplex algorithm for linear programming and solved two open problems in statistics.", "i": "https://codexery.com/mathematicians/img/mathematicians/george-dantzig.webp", "c": "via Wikipedia: George Dantzig · see source"}, "https://codexery.com/american-nobel-laureates/e/laureates/wassily-leontief/": {"t": "Wassily Leontief", "s": "Russian-American economist who pioneered input–output analysis."}, "/e/complexity-theory/np-hardness/": {"t": "NP-hardness", "s": "Problems at least as hard as the hardest in NP."}, "https://codexery.com/probability-statistics/e/probability-and-statistics/probability-distribution/": {"t": "Probability distribution", "s": "Mathematical description of probabilities for random phenomena.", "i": "https://codexery.com/probability-statistics/img/probability-and-statistics/probability-distribution.webp", "c": "Incnis Mrsi ( talk ) · Public domain"}, "https://codexery.com/danish-inventions/e/danish-inventions/google-maps/": {"t": "Google Maps", "s": "Web mapping platform launched by Google in 2005."}, "https://codexery.com/games-and-recreation/e/games-and-recreation/rubik-s-cube/": {"t": "Rubik's Cube", "s": "3D combination puzzle invented in 1974 by Ernő Rubik.", "i": "https://codexery.com/games-and-recreation/img/games-and-recreation/rubik-s-cube.webp", "c": "Mike Gonzalez (TheCoffee) · via Wikipedia: Rubik's Cube · CC BY-SA 3.0"}, "https://codexery.com/algorithms-and-data-structures/e/algorithms-and-data-structures/dynamic-programming/": {"t": "Dynamic programming", "s": "A method simplifying problems by recursive sub-problem breakdown."}, "https://codexery.com/pc-hardware/e/pc-hardware/benchmark-computing/": {"t": "Benchmark (computing)", "s": "A standard method for assessing relative performance of computer systems."}, "https://codexery.com/rules-of-thumb/e/rules-of-thumb/heuristic/": {"t": "Heuristic", "s": "A mental shortcut for satisfactory, not optimal, solutions."}, "https://codexery.com/discovery-and-invention-controversies/e/discovery-and-invention-controversies/integrated-circuit/": {"t": "Integrated circuit", "s": "Compact electronic circuits on a semiconductor chip revolutionized modern technology."}, "https://codexery.com/genetics/e/genetics/dna-sequencing/": {"t": "DNA sequencing", "s": "Determining the order of nucleotides in DNA."}, "https://codexery.com/universities-and-colleges/e/universities-and-colleges/harvard-university/": {"t": "Harvard University", "s": "Oldest institution of higher learning in the United States.", "i": "https://codexery.com/universities-and-colleges/img/universities-and-colleges/harvard-university.webp", "c": "Harvard University · via Wikipedia: Harvard University · Public domain"}, "https://codexery.com/olympic-athletics-venues/e/olympic-athletics-venues/santa-monica-california/": {"t": "Santa Monica, California", "s": "Coastal resort city in Los Angeles County, California."}}