tttardigrado

data P = R | L | Seq P P | Loop P

data Tape = Tape [Int] Int [Int]

empty :: Tape
empty = Tape (repeat 0) 0 (repeat 0)

left :: Tape -> Tape
left (Tape (l:ls) v rs) = Tape ls l (v:rs)

tttardigrado

CLIFFORD

Slightly altered (blured) version of Clifford attractors.

It follows the standard equations:

$$ x_{n+1} = \sin(a \cdot y_n) + c \cdot \cos(a \cdot x_n) $$

$$ y_{n+1} = \sin(b \cdot x_n) + d \cdot \cos(b \cdot y_n) $$

tttardigrado

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

struct vec {
  size_t size, cpcty;
  int *arr;
};

typedef struct vec Vec;

tttardigrado

import Data.List   (sortOn)
import Text.Printf (printf)

type Env a  = [(String, a)]
type Dist a = a -> a -> Int

lev :: Dist String
lev  x      ""    = length x
lev  ""     y     = length y
lev (x:xs) (y:ys) = if x == y

tttardigrado

Shortest code to determine if a string is a palindrome

Challenge link

Vyxal, 10 bytes

ɽẊ':₌ʀ±∨;Ḃ⁼

tttardigrado

Is the word coprime?

Challeng link

Vyxal, 17 bytes

Cƛ96-;2↔ƛġ;:₌Π∆Ŀ=