Dan Piponi dpiponi

🧱

In material form

Using an IBM Port-a-Punch I wrote my first program in Fortran in around 1978.

dpiponi / benford.py

Created November 28, 2020 01:51

	import csv
	import math
	import matplotlib.pyplot as plt
	import locale

	def frac(x):
	return x - math.floor(x)

	def first_digit(x):
	return int(math.floor(math.pow(10, frac(math.log10(x))) + 0.0001))

dpiponi / runner.py

Created August 27, 2020 15:34

Are these runners?

	# Python 3
	import collections
	Write = collections.namedtuple("Write", ["written"])

	def hello_world():
	yield Write("Hello, world!")
	yield Write("Hello, world!")
	return 1

	def identity(gen):

dpiponi / quine.c

Created July 23, 2020 01:12

A quine using only one loop and arithmetic (+, -, *, /, %)

	/*
	* This is a literate quine. That means that
	* 1. the comments will tell you a little about how it works and
	* 2. if you compile and run it its output will be identical to its source
	* code even though it doesn't look at its original source. It literally
	* contains within itself a complete recipe for how to display itself.
	*
	* Quines are ten a penny. This one is unusual because
	* 1. its main loop consists solely of a loop to print characters
	* generated by a function called programChar() and

dpiponi / short.txt

Created June 23, 2020 15:17

	A short exact sequence is a sequence of maps:
	f g h k
	0 --> A --> B --> C --> 0
	s.t.
	Im f = Ker g
	Im g = Ker h
	Im h = Ker k

	Example:

dpiponi / README.txt

Created August 6, 2019 04:26

Sandpile emulator in 6502 assembly language for Acorn Atom.

dpiponi / test.html

Created June 30, 2019 02:30

dpiponi / wasps.py

Created June 11, 2019 04:39

A neural network to learn like in the paper "Transitive inference in Polistes paper wasps"

	from __future__ import print_function

	import sys

	# If you don't know jax, check it out
	# https://github.com/google/jax
	import jax.numpy as np
	import jax.scipy as scipy
	from jax import jit, random, value_and_grad

dpiponi / test.lhs

Last active August 26, 2018 10:47

Invert infinite upper triangular matrix

	> scale :: Num a => a -> [a] -> [a]
	> scale a bs = map (a *) bs

	Invert an infinite upper triangular matrix with 1 on diagonal
	[
	[1, b₀₁, b₀₂, b₀₃, …],
	[1, b₁₂, b₁₃, …],
	[1, b₂₃, …],
	…
	]

dpiponi / shallow.py

Created July 21, 2018 18:02

Shallow image prior

	# Trying to get a handle on "Deep Image Prior"
	# at https://dmitryulyanov.github.io/deep_image_prior

	# This is a toy version with a single purely linear
	# convolution layer

	# The goal is to start with an image with high res detail,
	# corrupt a few bits, and then
	# repair the corrupt bits using an a priori model
	# that simply says "we can make the image from a lower resolution

dpiponi / main.hs

Last active June 5, 2018 21:43

	This code can be used to model very unlikely disruptions to your code,
	eg. hits by cosmic rays.

	This is the cosmic ray monad:

	> data Cosmic a = Cosmic { central::a, side::[a] } deriving Show

	Cosmic a b is considered equal to Cosmic a' b' if
	a==a' and b is a permutation of b'.