← Mathematical compendium

Published equation contexts

2k×2k2^k \times 2^k

Why this formula appears here

Because a genuine tensor decomposition composes with itself, the rank number converts directly into an asymptotic cost exponent, and DeepMind’s own paper does not spell out what that conversion yields — this is the article’s own arithmetic, shown rather than asserted. Applying Strassen’s 2×2 trick twice to reach 4×4 gives an algorithm whose cost scales as nlog⁡27n^{\log_2 7} ; applying it k times to reach a 2^k ×\times 2^k matrix costs 7^k multiplications for n = 2^k , the same exponent however you slice the recursion. A genuine rank-48 4×4 decomposition, applied the same way, would scale as nlog⁡448n^{\log_4 48} instead:

Read the full article-specific guide →

Read the representative guide

kk

Symbol k

k is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

2k×2k2^k \times 2^k

Equation 2 · Technological Evolution

Mathematicians Finished the Job After an Evolutionary Search Beat 56 Years of Human Proofs

This mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text.

Because a genuine tensor decomposition composes with itself, the rank number converts directly into an asymptotic cost exponent, and DeepMind’s own paper does not spell out what that conversion yields — this is the article’s own arithmetic, shown rather than asserted. Applying Strassen’s 2×2 trick twice to reach 4×4 gives an algorithm whose cost scales as nlog⁡27n^{\log_2 7} ; applying it k times to reach a 2^k ×\times 2^k matrix costs 7^k multiplications for n = 2^k , the same exponent however you slice the recursion. A genuine rank-48 4×4 decomposition, applied the same way, would scale as nlog⁡448n^{\log_4 48} instead:

Equation guide → · Article →