I hereby claim:
- I am wuggen on github.
- I am theunderdog09 (https://keybase.io/theunderdog09) on keybase.
- I have a public key ASCsjaITUjJpA6XkCmt8KatxQZ9i4OpwhuAl-xg-kEEYJAo
To claim this, I am signing this object:
(function() { | |
var MIN = 5; | |
var INTERVAL = 5; | |
var MSGS = [ | |
"That's five pages, buddy.", | |
"You gonna quit now or what?", | |
"I hope you know what you're doing here...", | |
"This is your periodic reminder that YET ANOTHER five pages have gone by." | |
]; |
I hereby claim:
To claim this, I am signing this object:
#[derive(Debug, Clone, PartialEq, Eq)] | |
pub struct DecayStack { | |
stack: Vec<StackEntry>, | |
current_decay: i32, | |
} | |
#[derive(Debug, Clone, Copy, PartialEq, Eq)] | |
struct StackEntry { | |
value: i32, | |
decay: i32, |
The How Many Registers Can I Cram Into 16-Bit Instructions architecture (provisional name; the answer seems to be 16, incidentally) is an 8-bit instruction set architecture designed for the game Turing Complete. It is a Harvard architecture — code and data are in separate memory spaces, and program memory is immutable at runtime. It uses fixed-width 16-bit instructions and operates on 8-bit data words. Both program and data memory are byte-addressed, with 8-bit addresses, meaning the maximum size for both program and data