SuperSonicHub1

<?xml version="1.0" encoding="utf-8"?>
<style xmlns="http://purl.org/net/xbiblio/csl" class="in-text" version="1.0" demote-non-dropping-particle="never" page-range-format="expanded">
  <info>
    <title>Taylor &amp; Francis - US Chicago Manual of Style B (numeric)</title>
    <id>http://kawcco.com/styles/taylor-and-francis-chicago-b-numeric</id>
    <link href="http://www.zotero.org/styles/taylor-and-francis-chicago-b-author-date" rel="self"/>
    <link href="http://www.zotero.org/styles/taylor-and-francis-chicago-author-date" rel="template"/>
    <link href="https://www.tandfonline.com/action/authorSubmission?show=instructions&amp;journalCode=bfsn20#references" rel="documentation"/>
    <link href="https://files.taylorandfrancis.com/tf_uschicagob.pdf?_ga=2.240778371.1215313033.1663204255-1541022656.1660640477&amp;_gl=1*sznl2u*_ga*MTU0MTAyMjY1Ni4xNjYwNjQwNDc3*_ga_0HYE8YG0M6*MTY2MzIwNDI1NS40LjEuMTY2MzIwNDI4Ny4wLjAuMA." rel="documentation"/>
    <author>

SuperSonicHub1

A pronoun algebra based on a person's Discord bio.

The notes I sent to them:

>>> (he | they) >> she
PronounPreferences(pronouns={she: 1, they: 0, he: 0})

My representation of pronouns is a partially ordered set (he is the symbol for the collection masculine pronouns; 0 means that collection of pronouns is most preferred).

SuperSonicHub1

// Description: one-bit full adder
// Arguments: a, b, carry in
// Return: {carry out, sum}
function Bit#(2) fullAdder(Bit#(1) a, Bit#(1) b, Bit#(1) c_in);
    Bit#(1) s = a ^  b ^ c_in;
    Bit#(1) c_out = (a & b) | (a & c_in) | (b & c_in);
    return {c_out, s};
endfunction

// Kogge-Stone adder, Lecture 4

SuperSonicHub1

Uses the Wayback CDX Server API.

Script expects a urls.json file. It can be retrieved with the following curl command

"https://web.archive.org/cdx/search/cdx?url=*.mit.edu&collapse=urlkey&output=json"

This will give you all unique URLs under the *.mit.edu namespace archived by the Wayback Machine. It's a few hundred megabytes, so the download may take a while.

SuperSonicHub1

from datetime import datetime, timedelta

from requests import get
from requests.exceptions import HTTPError
import matplotlib.pyplot as plt
import timple
import timple.timedelta as tmpldelta

tmpl = timple.Timple()
tmpl.enable()

SuperSonicHub1

Depends on nymphes_osc.

SuperSonicHub1

// iChannel0: webcam
// iChannel1: Brittney
// make sure both sources are on repeat
// shoutouts to einrail
// Unlicensed: https://unlicense.org/

// Seconds
#define P1 15.
#define P2 2.
#define P3 20.

SuperSonicHub1

Simple proofs of Arrow's theorem:

• https://sites.math.rutgers.edu/~zeilberg/EM22/yu2012.pdf
• http://dido.econ.yale.edu/~gean/art/p1116.pdf
• OG video: https://www.stat.uchicago.edu/~lekheng/meetings/mathofranking/ref/arrow.pdf

Proofs of the median voter theorem:

• OG: https://www.journals.uchicago.edu/doi/10.1086/256633
• https://ocw.mit.edu/courses/14-75-political-economy-and-economic-development-fall-2012/1e6fee72b12146c5feca334f93e788b6_MIT14_75F12_Lec6.pdf

Proofs of the Chichilnisky impossibility theorem:

SuperSonicHub1

#lang racket
(require racket/match)

; https://en.wikipedia.org/wiki/Hyperoperation#Definition
; Because the base case is succession, it becomes unusable at tetration.
(define (hyperoperator-succ n a b)
  (match (list n a b)
    [(list 0 _ _) (+ b 1)]
    [(list 1 _ 0) a]
    [(list 2 _ 0) 0]

SuperSonicHub1

import board
import digitalio
import usb_hid
from adafruit_hid.keyboard import Keyboard
from adafruit_hid.keycode import Keycode

kbd = Keyboard(usb_hid.devices)
button = digitalio.DigitalInOut(board.GP13)
button.switch_to_input(pull=digitalio.Pull.UP)