{c}

FFmpeg is likely the backend of <YouTube> through <reverse engineering>: https://streaminglearningcenter.com/blogs/youtube-uses-ffmpeg-for-encoding.html (https://web.archive.org/web/20190519135210/https://streaminglearningcenter.com/blogs/youtube-uses-ffmpeg-for-encoding.html[archive])

On <Quora>: https://www.quora.com/What-does-YouTube-use-for-encoding-video/answer/Ciro-Santilli


FFmpeg is the backend of YouTube

This is a tag for <films> that depict some sort of <artificial general intelligence>, but in which that is not the primary focus of the film.


Film depicting artificial intelligence

Freemium

{disambiguate=TV series}
{tag=Business film}
{title2=2014-2017}
{wiki}

Season 1 was amazing. The others fell off a bit.


Halt and Catch Fire

Halt and Catch Fire (TV series)

{c}
{title2=1959}
{wiki}

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


MOSFET

{tag=Company}

This section is about companies that design <semiconductors>.

For companies that manufature semiconductors, see also: <company with a semiconductor fabrication plant>.


Semiconductor company

{c}
{title2=2003}

List on <The Busy Beaver Challenge>: https://bbchallenge.org/skelet

Bibliography:
* https://bbchallenge.org/story#skelets-43-undecided-machines
* https://skelet.ludost.net/bb/nreg.html


Skelet’s machines

HyperNormalisation by Adam Curtis (2016)

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


Realistic robotics simulation

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

= Radiotelegraphy
{synonym}
{title2}


Wireless telegraphy

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)>.


Finite field of non-prime order

Fluorescent tag

Free radical

Open access academic publisher

{disambiguate=school}
{wiki}

No teachers, no courses, no tuition fees. Yes please!!! By <Xavier Niel>.


42 (school)

{title2=confer}
{title2=compare with}
{wiki}


Ciro Santilli @cirosantilli 37