 Home

Codex Wiki

Mathematics

Area of mathematics

Analysis

Functional analysis

Solvability complexity index

A tower of algorithms of height $k$ is a family $\Gamma_{n_k,\ldots,n_1}$ of finite-information algorithms such that
$$
\Xi(A)=\lim_{n_k\to\infty}\cdots\lim_{n_1\to\infty}\Gamma_{n_k,\ldots,n_1}(A)
$$
for every input $A$. The <Solvability complexity index> is the least possible height.

Tower of algorithms

Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 358 / 1 / a / Solution

Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 358 / 1 / b / Solution

Tower of algorithms

 Ancestors (6)

 Incoming links (2)

 Discussion (0)

 Articles by others on the same topic (0)

Tower of algorithms

 Ancestors (6)

 Incoming links (2)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (0)

 Discussion (0)