VictorTaelin

Solving SAT via interaction net superpositions

I've recently been amazed, if not mind-blown, by how a very simple, "one-line" SAT solver on Interaction Nets can outperform brute-force by orders of magnitude by exploiting "superposed booleans" and optimal evaluation of λ-expressions. In this brief note, I'll provide some background for you to understand how this works, and then I'll present a simple code you can run in your own computer to observe and replicate this effect. Note this is a new observation, so I know little about how this algorithm behaves asymptotically, but I find it quite

BaksiLi

#!/bin/bash

# Get the architecture of the machine
arch=$(uname -m)
os=$(uname -s)

# Download the Zellij binary
if [ "$os" == "Darwin" ]; then
  filename="zellij-${arch}-apple-darwin.tar.gz"
  url="https://github.com/zellij-org/zellij/releases/latest/download/$filename"

itowlson

[package]
name = "spinhost"
version = "0.1.0"
edition = "2021"

[dependencies]
# Spin runtime
spin-app = { git = "https://github.com/fermyon/spin", tag = "v1.3.0" }
spin-core = { git = "https://github.com/fermyon/spin", tag = "v1.3.0" }
spin-oci = { git = "https://github.com/fermyon/spin", tag = "v1.3.0" }

VictorTaelin

Implementing complex numbers and FFT with just datatypes (no floats)

In this article, I'll explain why implementing numbers with just algebraic datatypes is desirable. I'll then talk about common implementations of FFT (Fast Fourier Transform) and why they hide inherent inefficiencies. I'll then show how to implement integers and complex numbers with just algebraic datatypes, in a way that is extremely simple and elegant. I'll conclude by deriving a pure functional implementation of complex FFT with just datatypes, no floats.

VictorTaelin

(Rot (V z))   = (V (- 0.0 z))
(Rot (G x y)) = (G (Rot y) x)

(Add (V z)   (V w))   = (V (+ z w))
(Add (G x y) (G w z)) = (G (Add x w) (Add y z))

(Get (V x)   f) = (f x)
(Get (G x y) f) = (f x y)

Nil     = λm λx (m x)

VictorTaelin

Flip (n: Nat) : Nat
Flip Nat.zero            = 1n
Flip (Nat.succ Nat.zero) = 0n

Mod2 (n: Nat) : Nat
Mod2 Nat.zero     = Nat.zero
Mod2 (Nat.succ n) = Flip (Mod2 n)

IsEven (n: Nat) : Type
IsEven Nat.zero                = Unit

LukeMathWalker

name: Security audit
on:
  schedule:
    - cron: '0 0 * * *'
  push:
    paths:
      - '**/Cargo.toml'
      - '**/Cargo.lock'
jobs:
  security_audit:

PurpleBooth

Features

• Automatically bump SemVer
• Update a personal homebrew tap
• Keep that pesky version in the Cargo.toml up to date
• (From dependabot) Get new versions out as soon as possible

Assumptions

• You don't want a changelog

Pilotin

Setup

• Create new working folder /tailwind/. Open in terminal
• run npm init -y
• run npm install tailwindcss @tailwindcss/custom-forms postcss-cli autoprefixer postcss-nested cssnano
• run npx tailwind init
• Edit tailwind.config.js and replace plugins: [], with:

plugins: [

Boscop

// Delete Backward.
// Put this into your user packages folder. Can be found by navigating to Preferences > Browse Packages... in Sublime Text.
// Then add something like this to your user Key Bindings.
// { "keys": ["alt+backspace"], "command": "run_macro_file", "args": {"file": "res://Packages/User/Delete Subword Backward.sublime-macro"} }
[
	{
		"args":
		{
			"by": "subwords",
			"extend": true,