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

nataliefreed

// title      : OpenJSCAD Bezier, 2D/3D Export Example
// author     : Natalie Freed
// sources    : 2D/3D export technique from Lamp Shade Example

function getParameterDefinitions() {
    return [{ name: 'height', type: 'float', initial: 6, caption: "height:" },
            {
                name: 'type',
                type: 'choice',
                values: ["2D", "3D"],

zhpengg

/* Skip Lists: A Probabilistic Alternative to Balanced Trees */

#include <stdlib.h>
#include <stdio.h>
#include <limits.h>

#define SKIPLIST_MAX_LEVEL 6

typedef struct snode {
    int key;