D
dunric
After writing the computing urban legend "The Helsinki Code",
I spent several nights thinking up how in the world Gustav
Larsson, the Finnish PDP-8 computer programmer, could have
managed to receive such a miraculous message from God.
Surely, for a 1-byte computer program such as "@" to compile
successfully (in RTPS FORTRAN), a miracle compression algorithm
would be necessary.
Then it dawned on me. Gustav had accidentally stumbled upon
a compiled Fortran program compressed by the Impossibly Efficient
"Zeus Compression Algorithm" (ZCA). That is, a compression algo-
rithm so efficient that pages upon pages of text can be compressed
into a single byte. The ZCA, in theory, can compress the entire
contents of the Holy Bible into a single byte.
We presently know of no technology which can accomplish this, but
since God wrote the "@" program, only God could possibly make
the ZCA work. In future years, it will happen.
BTW, the story of the Helsinki Code can still be found online (just
search for it on Usenet).
A ZCA could work, in theory, like this:
(using pseudo-c)
'// ------------------------------------------------
'// zeus.c
'// An example of how a 1-byte Zeus Compression Algo
'// might be written.
'// Dec 18 2005 A.D.
'// Source code is public domain.
'// By: Paul Panks ([email protected])
'// ------------------------------------------------
#include "compress.hhf";
#include "stdlib.hhf";
#include "strings.hhf";
#include "math.hhf";
declare string w(str 32);
declare integer null(int 32);
declare integer io.channel.read(int 32);
declare integer io.channel.write(int 32);
declare string byte1(str 32 long);
declare string byte2(str 32 long);
declare array bytelevel[100];
null:=0;
w:=null;
io.channel.readwrite:=1;
byte1:=memory($01); '$01 is fist byte of read/write;
byte2:=memory($02); '$02 is second byte of read/write;
bytelevel[100]:=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,
17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,
36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,
55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,
74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,
93,94,95,96,97,98,99,100];
begin program zeus;
stdout.put("Zeus Compression Algorithm [ZCA]" nl nl);
stdout.put("Input file to compress to 1 byte: ");
get.input(w);
open.file(w,io.channel.readwrite);
readbit(byte1);
readbit(byte2);
compress(byte1,byte2) @ bytelevel[1 to 100];
call zeus; ' call special 'zeus' compression subroutine
bit.mark(byte1 as zeus);
bit.mark(byte2 as zeus);
term zeus; ' close special 'zeus' compression subroutine
writebit(byte1);
writebit(byte2);
close.file(w,io.channel.readwrite);
stdout.put("File compressed to 1 byte at 100% ratio." nl);
stdout.put("To uncompress, run 'dezeus' at shell prompt." nl nl);
stdout.put("Press a key to terminate application..." nl);
get.keyinput(w);
return 0;
end program zeus;
Paul
I spent several nights thinking up how in the world Gustav
Larsson, the Finnish PDP-8 computer programmer, could have
managed to receive such a miraculous message from God.
Surely, for a 1-byte computer program such as "@" to compile
successfully (in RTPS FORTRAN), a miracle compression algorithm
would be necessary.
Then it dawned on me. Gustav had accidentally stumbled upon
a compiled Fortran program compressed by the Impossibly Efficient
"Zeus Compression Algorithm" (ZCA). That is, a compression algo-
rithm so efficient that pages upon pages of text can be compressed
into a single byte. The ZCA, in theory, can compress the entire
contents of the Holy Bible into a single byte.
We presently know of no technology which can accomplish this, but
since God wrote the "@" program, only God could possibly make
the ZCA work. In future years, it will happen.
BTW, the story of the Helsinki Code can still be found online (just
search for it on Usenet).
A ZCA could work, in theory, like this:
(using pseudo-c)
'// ------------------------------------------------
'// zeus.c
'// An example of how a 1-byte Zeus Compression Algo
'// might be written.
'// Dec 18 2005 A.D.
'// Source code is public domain.
'// By: Paul Panks ([email protected])
'// ------------------------------------------------
#include "compress.hhf";
#include "stdlib.hhf";
#include "strings.hhf";
#include "math.hhf";
declare string w(str 32);
declare integer null(int 32);
declare integer io.channel.read(int 32);
declare integer io.channel.write(int 32);
declare string byte1(str 32 long);
declare string byte2(str 32 long);
declare array bytelevel[100];
null:=0;
w:=null;
io.channel.readwrite:=1;
byte1:=memory($01); '$01 is fist byte of read/write;
byte2:=memory($02); '$02 is second byte of read/write;
bytelevel[100]:=[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,
17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,
36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,
55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,
74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,
93,94,95,96,97,98,99,100];
begin program zeus;
stdout.put("Zeus Compression Algorithm [ZCA]" nl nl);
stdout.put("Input file to compress to 1 byte: ");
get.input(w);
open.file(w,io.channel.readwrite);
readbit(byte1);
readbit(byte2);
compress(byte1,byte2) @ bytelevel[1 to 100];
call zeus; ' call special 'zeus' compression subroutine
bit.mark(byte1 as zeus);
bit.mark(byte2 as zeus);
term zeus; ' close special 'zeus' compression subroutine
writebit(byte1);
writebit(byte2);
close.file(w,io.channel.readwrite);
stdout.put("File compressed to 1 byte at 100% ratio." nl);
stdout.put("To uncompress, run 'dezeus' at shell prompt." nl nl);
stdout.put("Press a key to terminate application..." nl);
get.keyinput(w);
return 0;
end program zeus;
Paul