RYSF13

a=1e3,b,c=1413,d,f[1414],n=800,k;main(){for(;b<c;
f[b++]=14);for(;n--;d+=*f*a,printf("%02d",d/a),*f
=d%a)for(d=0,k=c;--k;d/=b,d*=2*k-1)f[k]=(d+=f[k]*
a)%(b=100*k);}/* √2 2333 digits - Robert Ryan */

RYSF13

main(){while(!fork())printf("Catch me if you can!"),sleep(1);}

RYSF13

λ-Complete

Introduction

In mathematical logic, the lambda calculus (also written as $\lambda-Calculus$) is a formal system for expressing computation based on function abstraction and application using variable binding and substitution.

lλbmdλ cλlculus?

λ-calculus consists of constructing lambda terms and performing reduction operations on them. A term is defined as any valid lambda calculus expression. In the simplest form of lambda calculus, terms are built using only the rules below.

This is just about the untyped λ-calculus.

Expressions

$x$: A variable is a character or string representing a parameter.