halting problem
undecidable
semi-infinite
time complexity
RE
P
time out
nonparametric
transversality condition
Zeno
finitize
sitting
NC
loop
transfinite
batch
finitary
autoreducible
recursive function
clockable
recursive
arbitrary-precision arithmetic
base case
batch processing
Turing degree
draw straws
finitely
call
algebraical
finitizability
niceness
Ross-Littlewood paradox
pseudoinfinite
run-time
terminating
hypertask
random number
stopping time
burn off
penalty function
exit
static
abend
second best
underevaluate
computable
dynamic
uniprogramming
run time
dynamical system
planned obsolescence
oracle machine
cutoff
noncomputable
acceptor
busy beaver
turnpike
osculation
determinable
Collatz conjecture
overspecify
terminate
complexity theory
dynamic dispatch
operating time
logic error
borrowed time
terminable
timeout
bloatware
multiplication
softcode
critical path
nonconcurrency
finite-state automaton
decidable
rerun
supertask
NP-easy
least common multiple
real time
optimize out
time
voluntary
like painting the Forth Bridge
unparser
go short
Franklinize
finiteness
polynomial time
underprocess
thunk
pace
finitude
finitization
limit
fixed-cycle operation
boundedness