Google custom silicon by Ciro Santilli 37 Updated 2025-07-16
Google has put considerable effort into custom hardware to greatly optimize its stack, in a way that is quite notable compared to other tech companies.
20% time rule by Ciro Santilli 37 Updated 2025-07-16
The Google Story suggests that this practice existed in academia, where it was brought from. But I can't find external references to it easily:
At Google, the preference is for working in small teams of three, with individual employees expected to allot 20 percent of their time to exploring whatever ideas interest them most. The notion of "20 percent time" is borrowed from the academic world, where professors are given one day a week to pursue private interests.
Largey Brage by Ciro Santilli 37 Updated 2025-07-16
The outcome of Larry Page and Sergey Brin performing a Dragon Ball fusion dance.
Both of them attended Montessori education at some point. Interesting! Mentioned in a talk by Sergey and highlighted at The Google Story.
But in 2023 they were somewhat pulled back in by the AI race and competition with ChatGPT.[ref]
As The Google Story puts it about Largey:
Scholarship was not just emphasized in their homes; it was treasured.
Ciro Santilli likes that.
Early Google employee by Ciro Santilli 37 Updated 2025-07-16
ChatGPT produces:
  • Heather Cairns (Employee #4) - Joined in 1998. She handled HR and was one of the earliest administrative hires.
  • Harry Cheung (Employee #5) - Joined in 1999. An early engineer.
  • Gerald Aigner (Employee #6) - Hired in 1999. Worked as a software engineer.
  • Susan Wojcicki (Employee #16) - Joined in 1999. She rented her garage to Larry and Sergey in 1998 and later became an integral part of Google's business and advertising teams.
  • Marissa Mayer (Employee #20) - Hired in 1999. Played a major role in Google Search and design.
Omid Kordestani - Joined in 1999 as Google’s first business hire, focusing on sales and revenue generation.
Server (computing) by Ciro Santilli 37 Updated 2025-07-16
Video 1.
Unpacking 200 servers by Play with Junk (2021)
Source.
Video 2.
Visiting Hetzner in Falkenstein by der8auer (2022)
Source.
As per stackoverflow.com/a/52351480/895245 our standard test setup is:
while true; do
  resp=$"$(date): hello\n"
  len="$(printf '%s' "$resp" | wc -c)"
  printf "HTTP/1.1 200 OK\r\nContent-Length: $len\r\n\r\n${resp}\n" | nc -Nl 8000
done
Node (server) by Ciro Santilli 37 Updated 2025-07-16
It runs one instance of the Linux kernel and has one IP address. Each node is therefore a complete computer. As such is must also contain RAM memory, disk storage and a network interface controller.
  • there can be more than one node per server.
  • there can be more than one CPU per node
E.g.:
Chomsky hierarchy by Ciro Santilli 37 Updated 2025-07-16
This is the classic result of formal language theory, but there is too much slack between context free and context sensitive, which is PSPACE (larger than NP!).
A good summary table that opens up each category much more can be seen e.g. at the bottom of en.wikipedia.org/wiki/Automata_theory under the summary thingy at the bottom entitled "Automata theory: formal languages and formal grammars".
Computable number by Ciro Santilli 37 Updated 2025-07-16
There are only boring examples of taking an uncomputable language and converting it into a number?
Decision problem by Ciro Santilli 37 Updated 2025-07-16
Computational problem where the solution is either yes or no.
When there are more than two possible answers, it is called a function problem.
Decision problems come up often in computer science because many important problems are often stated in terms of "decide if a given string belongs to given formal language".

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact