Grand Commander Hou releases the 108 demons by
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
IEEE 754 is a standard for floating-point arithmetic that is widely used in computer systems and programming languages. Established by the Institute of Electrical and Electronics Engineers (IEEE), it defines formats for representing floating-point numbers and provides guidelines for performing arithmetic operations on these numbers in a consistent and reliable manner across different computing environments.
A leading-one detector is a digital circuit or algorithm used in various applications, primarily in digital signal processing and computer architecture, to identify the position of the first '1' bit in a given binary number or bit stream. This detection is useful in applications like arithmetic operations, encoding/decoding schemes, and data compression.
In computing, a "mask" generally refers to a bitmask or a mask used in various contexts to manipulate data at the binary level. Here are some common uses of masks in computing: 1. **Bitmasking**: This involves using bitwise operations to manipulate individual bits within a binary number. A mask can help isolate, modify, or clear specific bits in a binary value.
In 2020 physics, best explained by general relativity.
Predecessor to the synchrotron.
Offset binary, also known as "biased binary" or "excess-N" representation, is a binary number encoding system that is primarily used to represent signed integers in a way that makes certain arithmetic operations simpler, particularly in digital electronics. In offset binary, a bias value is added to the actual value being represented to compute its binary equivalent. For example, in an n-bit offset binary system, the bias is typically \( 2^{(n - 1)} \).
The type of feeling of confusion and distrut for your sense that some Koans attempt to instill.
Some notable references:
- kotobank.jp/word/大疑-556655 quotes passing referenes by
- en.wikipedia.org/wiki/Hakuin_Ekaku#Taigi_%E2%80%93_great_doubt mentions Hakuin Ekaku's take
Unfortunately, physicists and mathematicians keep using Greek letters in their formulas, so we just have to learn them.
A helpful way to remember is to learn a bit of their history/pronunciation: Section "Historical correspondence between Latin and Greek".
To learn the greek letters if you have a base latin alphabet, you must learn the sound of each letter, and which Latin letters they correspond to.
Symbols that look like Greek letters but are not Greek letters:
Is Ciro Santilli crazy (he is, but for this point specifically), or do many/most Greek letters represent the mouth position used in the pronunciation of the letter?
Single-precision floating-point format is a way to represent real numbers in binary using 32 bits (4 bytes). It is widely used in computing, especially in applications where a balance between performance and precision is necessary. The IEEE 754 standard defines how single-precision floating-point numbers are stored and interpreted. The 32 bits are divided into three main components: 1. **Sign Bit (1 bit)**: This bit indicates the sign of the number.
This is a weak point of grep, it can't handle large lines that don't fit fully into memory:
- superuser.com/questions/1703029/is-there-a-limit-for-a-line-length-for-grep-command-to-process-correctly what is the grep line limit?
- unix.stackexchange.com/questions/223078/best-way-to-grep-big-binary-file/758528#758528 Ciro's
bgrep
canon - large not required but mentioning bgrep anyways:
- superuser.com/questions/1368263/use-grep-for-a-long-line-to-get-the-part-of-the-line/1811969#1811969
- unix.stackexchange.com/questions/217936/equivalent-command-to-grep-binary-files/758544#758544
- stackoverflow.com/questions/2034799/how-to-truncate-long-matching-lines-returned-by-grep-or-ack/77263826#77263826
- stackoverflow.com/questions/9988379/how-to-grep-a-text-file-which-contains-some-binary-data leaving this one alone for now
- stackoverflow.com/questions/65674717/how-to-check-if-a-binary-file-is-contained-inside-another-binary-from-the-linux search pattern from file
A discrete 2D game on a rectangular grid: towardsdatascience.com/reinforcement-learning-implement-grid-world-from-scratch-c5963765ebff
This is analogous to many traditional board games such as chess, the concept is very natural and maps well into computer.
The downsides of gridworld games are:
- it is hard to model speed in discrete worlds. When you 10x faster, when do you collide with something else that is also crossing your path?
- they tend to not use vector representations of objects. So to have an object be 10x longer than another one, the naive implementation has to add 10 smaller objects. This becomes untenable as the number of objects increases.
Pinned article: ourbigbook/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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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