Void: Open-source Cursor alternative
github.com
Fui: C library for interacting with the framebuffer in a TTY context
github.com
A flat pricing subscription for Claude Code
support.anthropic.com
From: Steve Jobs. "Great idea, thank you."
blog.hayman.net
Progress toward fusion energy gain as measured against the Lawson criteria
fusionenergybase.com
Notes on rolling out Cursor and Claude Code
ghiculescu.substack.com
Phoenician culture spread mainly through cultural exchange
mpg.de
When Abandoned Mines Collapse
practical.engineering
How the US Built 5k Ships in WWII
construction-physics.com
Show HN: Using eBPF to see through encryption without a proxy
github.com
How to start a school with your friends
prigoose.substack.com
Podfox: First Container-Aware Browser
val.packett.cool
Using NASA’s SMAP satellite to detect L-band interference
radioandnukes.substack.com
First American pope elected and will be known as Pope Leo XIV
cnn.com
Mathematical Problem Solving
cip.ifi.lmu.de
Show HN: Req Update Check
github.com
Block Diffusion: Interpolating Autoregressive and Diffusion Language Models
m-arriola.com
Ciro (YC S22) is hiring a software engineer to build AI agents for sales
ycombinator.com
The Rise and Fall of the Visual Telegraph (2017)
parisianfields.com
A Brief History of Cursor's Tab-Completion
coplay.dev
Newsreels from the UCLA Film and Television Archive
newsreels.net
While this is a good approach to implements state machines, the transition function is hardwired to one transition graph. Another approach is to generalize the state and transition graph into a table, and group those transitions by a machine id, as shown here:
https://github.com/michelp/pgfsm
Now many machines (sub-graphs of state transitions) can be defined in general, and the transition checking function checks the validity of the next state based on the table, instead of static rules in a function.