Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for integer complexity 2 found (5 total)

alternate case: Integer complexity

Spellbound (2002 film) (1,542 words) [view diff] exact match in snippet view article

a PhD in Mathematics from the University of Michigan, focusing on integer complexity. George Thampy was speller # 245 in the bee and was mentioned several
Krohn–Rhodes theory (2,310 words) [view diff] exact match in snippet view article find links to article
complexity 1. In fact, there are semigroups of every non-negative integer complexity. For example, for any n greater than 1, the multiplicative semigroup