{c}
{title2=1959}
{wiki}

\Image[https://upload.wikimedia.org/wikipedia/commons/4/44/FET_cross_section.svg]


MOSFET

* https://learn-real.eu
* https://www.youtube.com/watch?v=6fo5NhnyR8I <OpenAI> realistic robot hand


Realistic robotics simulation

HyperNormalisation by Adam Curtis (2016)

{c}

One of <Satoshi's email addresses>, it's how he made the <First public announcement of Bitoin> on first public announcement of Bitcoin on 2008-10-31. 

At some point later on <vistomail.com> was discontinued and acquired by a super dodgy dude, <Alex Elbanna>, so it hasn't been Satoshi for a while.


satoshi@vistomail.com

Shuttleworth Foundation

{tag=Wireless}
{title2=1900}
{wiki}

= Radiotelegraphy
{synonym}
{title2}


Wireless telegraphy

Yandex

Work by Gwern Branwen

Cell sorting

Cluster analysis

As per <classification of finite fields> those must be of <prime power> order.

<video Finite fields made easy by Randell Heyman (2015)> at https://youtu.be/z9bTzjy4SCg?t=159 shows how for order $9 = 3 \times 3$. Basically, for order $p^n$, we take:
* each element is a polynomial in $GF(p)[x]$, $GF(p)[x]$, the <polynomial over a field>[polynomial ring over the finite field $GF(p)$] with degree smaller than $n$. We've just seen how to construct $GF(p)$ for prime $p$ above, so we're good there.
* addition works element-wise modulo on $GF(p)$
* multiplication is done modulo an <irreducible polynomial> of order $n$
For a worked out example, see: <GF(4)>.


Ciro Santilli @cirosantilli 37