Lukas' Notes
Search titles, aliases and note text. Use # for tags.
Retry
Dark mode
Light mode
Tag: computation
324 items with this tag.
2-Colouring Problem
computation
2-Partition Problem
computation
scheduling
2-Satisfiability Problem
computation
3-Colouring Problem
computation
3-Partition Problem
computation
scheduling
3-Satisfiability Decision Problem
computation
4-Colouring Problem
computation
graph-theory
Abiogenesis
evolution
biology
computation
Ackermann Function
computation
Algorithm
computation
Algorithmica
computation
Amortised Time Complexity
computation
Approximation Algorithm
computation
approximation
Approximation Problem
computation
approximation
Approximation Ratio
computation
approximation
Approximation Scheme
computation
Average Completion Time (Interval Scheduling)
computation
scheduling
Basis Family (Matroid)
computation
matroids
Bellman's Principle of Optimality
computation
Best Feasible Solution
computation
approximation
Best-case Running Time
computation
complexity-theory
bff
computation
complexity
evolution
Big-O-Star Notation
computation
complexity
Bin Packing Problem
computation
Binary Encoding
computation
Binary Supervised Learning Algorithm
learning-theory
computation
Biological Computation
biology
computation
Blank Symbol (Turing Machine)
computation
Border (String)
computation
Branch and Bound
computation
Brent's Hashing Algorithm
computation
Brute-force
computation
Brute-force Algorithm (Longest Common Subsequence)
longest-common-subsequence
computation
Brute-force Algorithm (String Matching)
string-matching
computation
Brute-force Search Space
computation
Busy-Beaver Function
computation
C-complete Decision Problem
computation
complexity-theory
C-hard Decision Problem
computation
complexity-theory
Centre Selection Problem
computation
algorithms
optimisation
Church-Turing Thesis
computation
Circuit (Matroid)
computation
matroids
Clique Decision Problem
computation
graph-theory
Co Decision Problem
computation
Co Halting Problem
computation
Code Language of a Function Property
computation
Code Language of a Language Property
computation
Coin Problem
computation
algorithms
optimisation
Colour Refinement Algorithm
graph-theory
computation
Combinatorial Search Space
computation
Combinatoric Optimisation Problem
computation
Completion Time (Interval Scheduling)
computation
scheduling
Complexity Class Membership
computation
complexity-theory
Computability Theory
computation
Computable Encoding
computation
Computable Function
computation
Computation
computation
Computational Irreducibility
philosophy
computation
Computronium
computation
physics
complexity
Configuration (Turing Machine)
computation
Constraint Satisfaction Problem
computation
Constrainted Longest Common Subsequence Problem
computation
Constructive Algorithm
computation
Context-Sensitive Language
computation
Control Problem
computation
Cook Reduction
computation
Correct Many-One Reduction
computation
Correct Reduction
computation
Correctness Problem
computation
Counting Problem
complexity-theory
computation
Currying
computation
Darwinism
evolution
biology
computation
Deadline (Interval Scheduling)
computation
scheduling
Decidable Decision Problem
computation
Decidable Function Property
computation
Decidable Language Property
computation
Decidable Predicate
computation
Decidable Set
computation
Decision Algorithm
computation
Decision Problem
computation
Delta-Approximable NP-Hard Optimisation Problem
computation
approximation
Depth (Interval Scheduling)
computation
scheduling
Deterministic Turing Machine
computation
turing-machines
Direction (Turing Machine)
computation
turing-machines
Distinct Row Matrix Completion Decision Problem
computation
recommendation
Dominating Set Problem
computation
graph-theory
Dovetailing
computation
Dual Heuristic
computation
heuristics
Due Date (Interval Scheduling)
scheduling
computation
Dynamic Programming
computation
Dynamic Programming Algorithm
computation
Dynamic Time Warping Distance Problem
dynamic-time-warping-distance
computation
Earliest Due Date First Algorithm (Interval Scheduling)
scheduling
computation
Earliest Start Time First Algorithm
computation
scheduling
Efficient Polynomial-time Approximation Scheme
computation
Electronic Discrete Variable Automatic Computer
computation
Electronic Numerical Integrator and Computer
computation
Encoding
computation/encodings
Encoding of a Turing Machine
computation
Exact Algorithm
computation
Exact Cover Problem
computation
Exactly One of Two Reachable Code Problem
computation
Exchange Graph
combinatorics
computation
Exponential Search Space
computation
Exponential Time Hypothesis
complexity-theory
computation
Extended Church-Turing Thesis
computation
Extensional Function Property
computation
Factor-Delta Approximate Solution
computation
approximation
Factor-δ Approximation Algorithm
computation
optimisation
Feasible Schedule (Interval Scheduling)
computation
scheduling
Feasible Solution
computation
Feedback Arc Set Decision Problem
computation
graph-theory
Ferranti Mark 1
computation
history
Ferranti Mark 2
computation
history
Fibonacci Number
computation
Finite Turing Machine
computation
First In First Out
computation
Four-Color Theorem
computation
graph-theory
Fully Polynomial-time Approximation Scheme
optimisation
approximation
computation
Function Property
computation
Functional Problem
computation
Gadget
computation
complexity-theory
Gale–Shapley Algorithm
computation
Gödel Number
logic
computation
Gödel Numbering
logic
computation
Graham's List Scheduling Algorithm
computation
scheduling
Graph-Reachability Problem
computation
Graphic Matroid
graph-theory
computation
combinatorics
Greedy Algorithm
computation
Guessing (Nondeterministic Turing Machine)
computation
nondeterministic-turing-machines
Halting Problem
computation
Hamiltonian Path Problem
computation
graph-theory
Heuristic
computation
Hierholzer's Algorithm
computation
Highest-Degree First Minimum Vertex Cover Algorithm
graph-theory
computation
Horn Formula
logic
computation
Idealised Computational Model
computation
Implication Graph
computation
In-Place Algorithm
computation
Independent Set (Matroid)
combinatorics
computation
Independent Set Problem
computation
Initial-segment Notation
combinatorics
computation
Injective Encoding
computation
Input Tape (Turing Machine)
computation
Instance
computation
Instance Space
computation
Intensional Function Property
computation
Interaction Net
computation
Interval (Scheduling)
computation
scheduling
Interval Partitioning Problem
computation
scheduling
Interval Scheduling Problem
computation
scheduling
Intractable Problem
computation
Iterative Improvement Algorithm
computation
Job (Scheduling)
computation
scheduling
k-Colouring Problem
computation
k-Partition Problem
computation
scheduling
k-Satisfiability Problem
computation
logic
sat
Karp Reduction
computation
Kendall Tau Distance
computation
Knapsack Problem
computation
Kolmogorov Machine
computation
Krom Formula
logic
computation
Lambda Calculus
computation
lambda-calculus
Language of a Decision Problem
computation
Last In First Out
computation
Lateness (Interval Scheduling)
computation
scheduling
Learning Algorithm
computation
learning-theory
Learning Problem
computation
Life
biology
evolution
computation
philosophy
Linear Bounded Automaton
computation
Load Balancing Problem
computation
Longest Common Subsequence Problem
strings
computation
longest-common-subsequence
Machine (Scheduling)
computation
scheduling
Makespan (Interval Scheduling)
computation
scheduling
Many-one Reduction
computation
Matrix Completion Problem
computation
Matroid
combinatorics
computation
requires-cleanup
Matroid Optimisation Problem
matroids
computation
Max-Value Knapsack
computation
Max-Value Knapsack Problem
computation
Maximal Matching Minimum Vertex Cover Algorithm
graph-theory
computation
approximation-algorithms
Maximisation Problem
computation
Maximum Non-Blocker Problem
computation
graph-theory
Maximum Satisfiability Problem
computation
approximation
optimisation
Maximum-Weight Matroid Greedy Algorithm
computation
Maximum-Weight Matroid Optimisation Problem
computation
combinatorics
Maximum-Weight Spanning Tree
computation
graph-theory
McCulloch–Pitts Model
neuroscience
computation
Metric Travelling Salesman Problem
computation
Minimal NP-hard Problem
computation
Minimal Set Cover Problem
computation
Minimal Spanning Tree Search Problem
graph-theory
computation
Minimal Vertex Cover Problem
computation
Minimisation Problem
computation
Minimum Vertex Cover Problem
graph-theory
computation
Model-Checking Problem
computation
logic
Molecular Computing
computation
Morphogenesis
biology
computation
Mu Recursion
computation
Mu-Recursive Function
computation
MuBar Operator
computation
Multitape Turing Machine
computation
MuZero Operator
computation
n-Queens
games
computation
Naive Algorithm
computation
Non-constructive Algorithm
computation
Non-trivial Extensional Language Property
computation
Non-Trivial Function Property
computation
Nondeterministic Polynomial Problem
computation
complexity-theory
Nondeterministic Turing Machine
computation
Normal Form (Turing Machine)
computation
NP-complete Decision Problem
computation
complexity-theory
NP-complete Problem
computation
NP-hard Decision Problem
computation
complexity-theory
NP-Hard Optimisation Problem
computation
NP-hard Problem
computation
Objective Function
computation
On Computable Numbers, with an Application to the Entscheidungsproblem
computation
Open-Endedness
evolution
computation
Optimal Greedy Algorithm
computation
Optimal Objective Function
computation
Optimal Schedule
scheduling
computation
Optimal Solution
computation
optimisation
Optimisation Problem
computation
optimisation
Oracle Turing Machine
computation
P vs NP Problem
computation
Parse Tree
trees
computation
compilers
Partial Computable Function
computation
Partition Problem
computation
Perfect Matching
computation
Perfect Matching Lemma (Matroid Exchange Graph)
combinatorics
computation
Permutation Space
computation
Pi Calculus
computation
Planar Dominating Set Problem
computation
graph-theory
Planar Independent Set Problem
computation
graph-theory
Planar Vertex Cover Problem
computation
graph-theory
Polynomial Running Time
computation
complexity-theory
Polynomial-time Algorithm
computation
Polynomial-time Approximation Algorithm
computation
approximation
Polynomial-time Approximation Scheme
computation
Polynomial-time Computable Function
computation
Positive Problem Instance
computation
Precedence Constraint (Scheduling)
computation
scheduling
Preemption (Interval Scheduling)
computation
scheduling
Prefix Function
strings
computation
Prim's Algorithm
computation
graph-theory
algorithms
Problem
computation
Procedure
computation
Processor Time
operating-systems
computation
Profit (Knapsack Problem)
computation
knapsack-problem
Program
computation
Pushdown Automaton
computation
Quasipolynomial Running Time
computation
complexity-theory
Quiescence Search
computation
Quine
computation
Randomised Algorithm
computation
probability-theory
Rank (Matroid)
matroids
computation
Reachable Code Problem
computation
Reduction
computation
Register Machine
computation
Register Machine Program
computation
Reinforcement Learning Algorithm
computation
learning-theory
reinforcement-learning
Rice's Theorem
computation
languages
Rosenblatt Perceptron
neuroscience
computation
Ruliad
computation
philosophy
Running Time
computation
complexity-theory
Same Output Problem
computation
Satisfiability Problem
computation
Schedule (Interval Scheduling)
computation
scheduling
Scheduling Notation
scheduling
computation
Scheduling Problem
computation
scheduling
Search Problem
computation
Segmented Least Squares Problem
computation
Self-Replicating Program
computation
Semi-Decidable Decision Problem
computation
Shortest Path Problem
computation
graph-theory
SIMPLE Programming Language
computation
Single-exponential Time Algorithm
computation
complexity
Solution
computation
Stable Matching Problem
computation
Standard Description
computation
Star Sum Problem
computation
graph-theory
State (Turing Machine)
computation
turing-machines
State of Mind
computation
Strict Deadline (Interval Scheduling)
computation
scheduling
String Matching Problem
strings
computation
Strong Exponential Time Hypothesis
computation
complexity
Sub-exponential Algorithm
computation
complexity
Supervised Learning Algorithm
computation
learning-theory
supervised-learning
Switching Theory
digital-logic
computation
Symbol (Turing Machine)
computation
turing-machines
Symbolic Computation
computation
logic
Symmetric Travelling Salesman Problem
computation
Tape (Turing Machine)
computation
The Bitter Lesson
computation
artificial-intelligence
Total Completion Time (Interval Scheduling)
computation
scheduling
Total Computable Function
computation
Totally Recursive Function
computation
Tractable Problem
computation
Transition Relation (Deterministic Turing Machine)
computation
turing-machines
Transition Relation (Nondeterministic Turing Machine)
computation
turing-machines
Transition Relation (Turing Machine)
computation
turing-machines
Travelling Salesman Problem
computation
Tree-width
computation
Turing Completeness
computation
Turing Gas
computation
complexity
evolution
Turing Machine
computation
requires-cleanup
Turing Reduction
computation
Turing-Computable Arithmetic Function
computation
Unary Encoding
computation
Undecidable Decision Problem
computation
Undecidable Function Property
computation
Undecidable Language Property
computation
Unit Propagation
logic
computation
sat-solving
Universal Turing Machine
computation
Universal Unrestricted Register Machine Program
computation
Unsatisfiability Problem
computation
Verification (Nondeterministic Turing Machine)
computation
nondeterministic-turing-machines
Vertex Cover Problem
computation
Wagner–Fischer algorithm
computation
Weight (Knapsack Problem)
computation
knapsack-problem
Weighted Independent Set Problem
computation
Word (Computing)
computation
Work Tape (Turing Machine)
computation
Worst-case Running Time
computation
complexity-theory
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
Page 1 of 33