Skip to content

Instantly share code, notes, and snippets.

Why SWEs Can't Have Nice Things
Not that long ago, and not that far away (from San Francisco, as it were) at a
software company, one of those billion-dollar concerns you've heard of, a Vice
President attended a dwarf-tossing-slash-coke orgy on his rival's yacht. He
couldn't enjoy himself, for that intrusive realization: "This guy's boat's
twice as big as mine! No wonder I haven't been promoted." So, when he returned
to work, he knew what he needed to do: "free up salary" (fire people) to justify
a bonus for himself.
>>> def dp():
... r = random.randint(1, 8)
... if r < 4: return 0
... if r < 7: return 1
... if r == 7: return 2
... if r == 8:
... out = 3
... while random.randint(1, 8) == 8:
... out += 1
... return out
IMP GrIMP DarkIMP TRICKER
SCUM MUCK OOZE PINKPUFF
PIRATE KYZOKU ROGUE RAIDER
Frost D Red D Blue D Green D
OGRE GrOGRE WzOGRE ONI
WIZARD PRIEST TimeMAGE SAGE
SAHAG R.SAHAG SandHAG WzSAHAG
OCHU NAOCHU MORBOL GrMORBOL
CARIBE SHARK R.CARIBE W.SHARK
HYDRA Red H Blue H Green H
@michaelochurch
michaelochurch / LCO.txt
Last active June 29, 2019 12:50
Large Countable Ordinals
ω^ω:
0 < 1 < 2 < 4 < 8 < ... < 3 < 6 < 12 < 24 < ... 9 < 18 < 36 < 72 < ...
< 5 < 10 < 20 < ... < 15 < 30 < 60 < ... 45 < 90 < 180 < ...
< 25 < 50 < 100 < ...
< 7 < 14 < 28 < 56 < ...
< 11 < 22 < 44 < 88 < ...
... and so on.
I believe this is correct. Please let me know if there are errors.
X | - 0 +
---------
- | + 0 -
0 | - 0 +
+ | 0 + -
Call this gate "R". It's universal, assuming we have fan-out (trit-copying) and the constants. That is, a circuit of R's can be built
to represent any function f: T^n -> T where T = {-, 0, +}.
@michaelochurch
michaelochurch / setbang-powerset
Created April 29, 2016 00:10
Building up a power-set operator in FiniteSetBang3
: There is probably a mistake in here...
: Macroexpanded prod in FSB3 with %-comprehensions:
: Keep in mind that [] are *-loops in this language.
: prod : ... X Y -> ... {(x, y) for x in X, y in Y}
prod:%[{~/~/>~{~/~/~/{%[{~/~/>~{~/~/~/>{~/~/>~~{{~/~/>/{~/~/>/{~/~/~/>{{~/~/>/{~/~/>/{{~/~/>/{~/~/>/~{{~/~/>/{~/~/>/]{~/~/>_]{~/~/>_
Conversion of %-comprehensions:
Never gonna give you up,
never gonna let you down,
never gonna run around and
desert you.
Name of a character in another writing project.
ihaskell-inline-r-0.1.0.0: build
HaskellR-examples-0.1.0.0: build
-- While building package ihaskell-inline-r-0.1.0.0 using:
/Users/michaelchurch/.stack/setup-exe-cache/setup-Simple-Cabal-1.18.1.5-x86_64-osx-ghc-7.8.4 --builddir=.stack-work/dist/x86_64-osx/Cabal-1.18.1.5/ build lib:ihaskell-inline-r --ghc-options -hpcdir .stack-work/dist/x86_64-osx/Cabal-1.18.1.5/hpc/.hpc/ -ddump-hi -ddump-to-file
Process exited with code: ExitFailure 1
Logs have been written to: /Users/michaelchurch/stack-explore/HaskellR/.stack-work/logs/ihaskell-inline-r-0.1.0.0.log
Preprocessing library ihaskell-inline-r-0.1.0.0...
[1 of 1] Compiling IHaskell.Display.InlineR ( src/IHaskell/Display/InlineR.hs, .stack-work/dist/x86_64-osx/Cabal-1.18.1.5/build/IHaskell/Display/InlineR.o )
@michaelochurch
michaelochurch / buglog.txt
Last active September 15, 2015 16:27
Replication of steps leading to Stack bug found on 2015-09-10 (v. 1.4.0)
$ ghc --version
The Glorious Glasgow Haskell Compilation System, version 7.10.2
$ which ghc
/usr/bin/ghc
$ ghc-pkg list -v
Timestamp 2015-09-10 20:43:28 UTC for /Users/michaelchurch/.ghc/x86_64-darwin-7.10.2/package.conf.d/package.cache
Timestamp 2015-09-10 20:43:28 UTC for /Users/michaelchurch/.ghc/x86_64-darwin-7.10.2/package.conf.d (same as cache)
using cache: /Users/michaelchurch/.ghc/x86_64-darwin-7.10.2/package.conf.d/package.cache