Turing machine regex tape notation is Ciro Santilli's made up name for the notation used e.g. at:Most of it is just regular regular expression notation, with a few differences:
- denotes the right or left edge of the (zero initialized) tape. It is often omitted as we always just assume it is always present on both sides of every regex
A
,B
,C
,D
andE
denotes the current machine state. This is especially common notation in the context of the BB(5) problem<
and>
next to the state indicate if the head is on top of the left or right element. E.g.:indicates that the head11 (01)^n <A 00 (0011)^{n+2}
A
is on top of the last1
of the last sequence of n01
s to the left of the head.
This notation is very useful, as it helps compress long repeated sequences of Turing machine tape and extract higher level patterns from them, which is how you go about understanding a Turing machine in order to apply Turing machine acceleration.
Just add GDB Dashboard, and you're good to go.
Are there more than 3 generations of particles in the Standard Model? by
Ciro Santilli 37 Updated 2025-07-16
Sometimes you can debug software by staring at the code for long enough by
Ciro Santilli 37 Updated 2025-07-16
A senior developer came over, and rather than trying to run and modify the code like an idiot, which is what Ciro Santilli usually does (see also experimentalism remarks at Section "Ciro Santilli's bad old event memory"), he just stared at the code for about 10 minutes.
We knew that the problem was likely in a particular function, but it was really hard to see why things were going wrong.
After the 10 minutes of examining every line in minute detail, he said:and truly, that was the cause.
I think this function call has such or such weird edge case
And so, Ciro was enlightened.
The point of these is that they are good for transfection apparently.
How an atomic clock works, and its use in the global positioning system (GPS) by EngineerGuy (2012)
Source. Shows how conceptually an atomic clock is based on a feedback loop of two hyperfine structure states of caesium atoms (non-radioactive caesium-133 as clarified by the Wikipedia page). Like a quartz clock, it also relies on the piezoelectricity of quartz, but unlike the quartz clock, the quartz is not shaped like a tuning fork, and has a much larger resonating frequency of about 7 MHz. The feedback is completed by producing photons that resonate at the right frequency to excite the caesium.Inside the HP 5061A Cesium Clock by CuriousMarc (2020)
Source. A similar model was used in the Hafele-Keating experiment to test special relativity on two planes flying in opposite directions. Miniaturization was key.
Contains a disposable tube with 6g of Caesium. You boil it, so when it runs out, you change the tube, 40k USD. Their tube is made by Agilent Technologies, so a replacement since that opened in 1999, and the original machine is from the 60s.
Detection is done with an electron multiplier.
youtu.be/eOti3kKWX-c?t=1166 They compare it with their 100 dollar GPS disciplined oscillator, since GPS satellites have atomic clocks in them.
Quick presentation of the atomic clock at the National Physical Laboratory (2010)
Source. Their super accurate setup first does laser cooling on the caesium atoms. 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!
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