 Tower of algorithms

ID: tower-of-algorithms

k

is a family

Γ_{n_{k}, \dots, n_{1}}

of finite-information algorithms such that

Ξ (A) = lim_{n_{k} \to \infty} \dots lim_{n_{1} \to \infty} Γ_{n_{k}, \dots, n_{1}} (A)

for every input

A

 New to topics? Read the docs here!