James Ross • Flying Robots
Seattle, WA • Email • LinkedIn
.-:::::'::: .-:. ::-.::::::. :::. .,-:::::/
;;;'''' ;;; ';;. ;;;;';;;`;;;;, `;;;,;;-'````'
[[[,,== [[[ '[[,[[[' [[[ [[[[[. '[[[[[ [[[[[[/
`$$$"`` $$' c$$" $$$ $$$ "Y$c$$"$$c. "$$
888 o88oo,.__ ,8P"` 888 888 Y88 `Y8bo,,,o88o
"MM, """"YUMMMmM" MMM MMM YM `'YMUP"YMM
:::::::.. ... :::::::. ... :::::::::::: .::::::.
;;;;``;;;; .;;;;;;;. ;;;'';;' .;;;;;;;.;;;;;;;;'''';;;` `
[[[,/[[[' ,[[ \[[, [[[__[[\.,[[ \[[, [[ '[==/[[[[,
$$$$$$c $$$, $$$ $$""""Y$$$$$, $$$ $$ ''' $
888b "88bo,"888,_ _,88P_88o,,od8P"888,_ _,88P 88, 88b dP
MMMM "W" "YMMMMMP" ""YUMMMP" "YMMMMMP" MMM "YMmMY"Is the universe a deterministic graph rewrite engine, or does it just look like one because we're imperfect observers?
I build systems around WARP graphs: bit-perfect replay, time-travel debugging, provenance sovereignty, and computational holography.
Computation is more beautiful than we’ve been told. There’s a geometry of thought and a physics of computation. With the right invariants, the structure snaps into focus, and computers become truth-powered time machines that can show us not just what happened, but what could have happened, too.
Together, let’s:
- Build time-travel debugging through deterministic replay: rewind, inspect, fork any execution
- Reveal the shape of machines: WARP graphs reveal computation’s hidden geometry
- Quantify refactor difficulty: why some code yields, and some code resists