P
NP-easy
computable
Cook reduction
numerical analysis
algebraical
NC
oracle machine
P-complete
NP-hard
Jacobian conjecture
recursive
RE
computability theory
busy beaver
noncomputable
clockable
NP-complete
hyperjump
superpolynomial
Schinzel's hypothesis H
AAK theory
rational function
decider
penalty function
boundary condition
formula
rule
rational root theorem
Church-Turing thesis
time complexity
quantize
Zeno machine
structure
simultaneous equations
Turing computable function
transfer function
transversality condition
polynomial time
coefficient
computable function
Lax pair
apodize
universal Turing machine
polynomially
complete
Karp reduction
solvable
halting problem
resolvable
Pell number
symmetric polynomial
finitizability
chakravala method
polytime
quartic function
turnpike
Turing jump
Cramer's rule
Abel polynomial
Legendre polynomial
cadlag
heuristic
irreducible
integral
algebraic variety
transcendental function
conjugate
kernelization
Tarski-Seidenberg theorem
algebraic
Horner's rule
renewal theory
open
relaxation method
Loschmidt's paradox
relaxation
tractable
batch
Buchberger's algorithm
discontinuous
multigrid
compactification
hypertask
recursive definition
Lagrange's interpolation formula
numericist
Whittle likelihood
initial value problem
approximant
convergency
Sendov's conjecture
σ-finite measure
recursive function
Størmer's theorem
convergence