Ciro Santilli's account is www.reddit.com/user/cirosantilli/, see also: accounts controlled by Ciro Accounts.

Freshly made douhua is a blessing.

Lance instructor of the 800,000 Imperial Guards (八十万禁军枪棒教头). TODO understand the "枪棒" part: zhidao.baidu.com/question/206659649.html.

The adopted son of Gao Qiu wanted to fuck his wife, and because of this they frame him of planning to take revenge by killing Go Qiu, even though Lin Chong had decided not to take revenge to avoid harming his wife further.

They just keep trying to kill him, until at one point he just gives up and becomes a fugitive.

His story is well told in The Water Margin.

Usually called by others as 林教头 (lin jiaotou, literally Head Instructor Lin, but usually translated as just Instructor Lin).

Her neck is huge! She also redid her teeth at some point apparently. Some good photos at: www.irishtimes.com/life-and-style/people/mackenzie-scott-how-the-former-mrs-bezos-became-a-philanthropist-like-no-other-1.4850049

archive.org/details/makingciscoconne0000bunn on the Internet Archive Open Library.

Nothing phenomenally new on the early days to add on top of Video "Nerds 2.0.1 excerpt about Cisco (1998)", but a few new good points:

The list: complexityzoo.uwaterloo.ca/Complexity_Zoo

The Busy beaver scale allows us to gauge the difficulty of proving certain (yet unproven!) mathematical conjectures!

To to this, people have reduced certain mathematical problems to deciding the halting problem of a specific Turing machine.

A good example is perhaps the Goldbach's conjecture. We just make a Turing machine that successively checks for each even number of it is a sum of two primes by naively looping down and trying every possible pair. Let the machine halt if the check fails. So this machine halts iff the Goldbach's conjecture is false! See also Conjecture reduction to a halting problem.

Therefore, if we were able to compute $BB(n)$, we would be able to prove those conjectures automatically, by letting the machine run up to $BB(n)$, and if it hadn't halted by then, we would know that it would never halt.

Of course, in practice, $BB$ is generally uncomputable, so we will never know it. And furthermore, even if it were computable, it would take a lot longer than the age of the universe to compute any of it, so it would be useless.

However, philosophically speaking at least, the number of states of the equivalent Turing machine gives us a philosophical idea of the complexity of the problem.

The busy beaver scale is likely mostly useless, since we are able to prove that many non-trivial Turing machines do halt, often by reducing problems to simpler known cases. But still, it is cute.

But maybe, just maybe, reduction to Turing machine form could be useful. E.g. The Busy Beaver Challenge and other attempts to solve BB(5) have come up with large number of automated (usually parametrized up to a certain threshold) Turing machine decider programs that automatically determine if certain (often large numbers of) Turing machines run forever.

So it it not impossible that after some reduction to a standard Turing machine form, some conjecture just gets automatically brute-forced by one of the deciders, this is a path to

The only perfect cryptosystem!

The problem is that you need a shared key as large as the message.

Systems like advanced Encryption Standard allow us to encrypt things larger than the key, but the tradeoff is that they could be possibly broken, as don't have any provably secure symmetric-key algorithms as of 2020.

We need a mini-series, this just doesn't have enough time. Notably, too much focus on dob, and not enough on the development of Silk Road iteslf. Though it is cool to see what his motivations might have been like. One wonders how realistic the character is. Though him meeting Ross Ulbricht personally sounds exceptionally unlikely.

Ross Ulbricht told her about Silk Road, but then later said he had sold the website to someone else, without really doing that.

As of 2023, she's apparently a photographer with a porny focus (boudoir photography).

Some sources: