December 11th, 2014


Идеал хипсторского языка

There are languages easy to work with (most non-esoteric languages). There are also languages hard to work with (like Malbolge). The problem with hard languages is that when they are too hard, users won't program in them or worse employ some cryptoanalysis-based approach to break them and successfully write a program. So, the idea:

  • a language hard enough so no usable program can be created with it in reasonable time;

  • a language easy enough to lure programmers into writing programs in it, discourage cryptoanalysis and systematic approach.

  • The goal is to maximize wasted programming hours before the user gives up.

  • Programming in this language must be impossible, but the user has to have illusion that it is possible (if not easy).


Уравнение, эквивалентное задаче останова

Диофантово уравнение с параметром, решение которого в общем виде эквивалентно задаче останова

Formalisms for Computation: Register Machines, Exponential Diophantine Equations, & Pure LISP

By Gregory. J. Chaitin

we present a method for compiling register machine programs into exponential diophantine equations. In Chapter 3 we present a stripped-down version of pure LISP. And in Chapter 4 we present a register machine interpreter for this LISP, and then compile it into a diophantine equation. The resulting equation, which unfortunately is too large to exhibit here in its entirety, has a solution, and only one, if the binary representation of a LISP expression that halts, i.e., that has a value, is substituted for a distinguished variable in it. It has no solution if the number substituted is the binary representation of a LISP expression without a value.