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 (du****@yahoo.c om)
'// ------------------------------------------------
#include "compress.h hf";
#include "stdlib.hhf ";
#include "strings.hh f";
#include "math.hhf";
declare string w(str 32);
declare integer null(int 32);
declare integer io.channel.read (int 32);
declare integer io.channel.writ e(int 32);
declare string byte1(str 32 long);
declare string byte2(str 32 long);
declare array bytelevel[100];
null:=0;
w:=null;
io.channel.read write:=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("Zeu s Compression Algorithm [ZCA]" nl nl);
stdout.put("Inp ut file to compress to 1 byte: ");
get.input(w);
open.file(w,io. channel.readwri te);
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.readwr ite);
stdout.put("Fil e compressed to 1 byte at 100% ratio." nl);
stdout.put("To uncompress, run 'dezeus' at shell prompt." nl nl);
stdout.put("Pre ss a key to terminate application..." nl);
get.keyinput(w) ;
return 0;
end program zeus;
Paul 17 3142 du****@yahoo.co m writes: 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.
[snip] A ZCA could work, in theory, like this: (using pseudo-c)
[...] declare integer io.channel.writ e(int 32); declare string byte1(str 32 long); declare string byte2(str 32 long); declare array bytelevel[100]; null:=0;
[snip]
I've seen some stuff about the "Helsinki Code" elsewhere, but
comp.lang.c has been relatively free of it so far.
The author seems to be under the delusion (a) that something he
recently made up out of whole cloth qualfies as an "urban legend",
(b) that the "pseudo-c" he posted bears some resemblance to actual C,
and (c) that anyone might actually be interested.
It's not C, it's off-topic, and it's almost certainly total nonsense.
For those of you who use killfiles, I suggest adding an entry. Beyond
that, please don't feed the troll.
--
Keith Thompson (The_Other_Keit h) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Keith Thompson <ks***@mib.or g> wrote: du****@yahoo.co m writes:
[ SNIP! ] The author seems to be under the delusion
The author is under many, many delusions. He is well known in another
group I frequent as one of the most self-delusional individuals on this
globe. He isn't even a troll - he doesn't have the grasp on reality to
understand that he's not the genius he thinks he is.
Richard
Richard Bos wrote: Keith Thompson <ks***@mib.or g> wrote:
du****@yahoo. com writes:
[ SNIP! ]
The author seems to be under the delusion
The author is under many, many delusions. He is well known in another group I frequent as one of the most self-delusional individuals on this globe. He isn't even a troll - he doesn't have the grasp on reality to understand that he's not the genius he thinks he is.
Richard
Wait, god using C to write a program ???
Nice... What *compiler* did he use?
I would bet that he compiled with lcc-win32!!!
I'm going straight to heaven :-)
jacob
Keith Thompson wrote: du****@yahoo.co m writes: 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. [snip] A ZCA could work, in theory, like this: (using pseudo-c)
[...] declare integer io.channel.writ e(int 32); declare string byte1(str 32 long); declare string byte2(str 32 long); declare array bytelevel[100]; null:=0; [snip]
I've seen some stuff about the "Helsinki Code" elsewhere, but comp.lang.c has been relatively free of it so far.
The author seems to be under the delusion (a) that something he recently made up out of whole cloth qualfies as an "urban legend", (b) that the "pseudo-c" he posted bears some resemblance to actual C, and (c) that anyone might actually be interested.
It's not C, it's off-topic, and it's certainly total nonsense.
Fixed the above sentence. No compression algorithm (known or unknown)
can compress *any* file to just one byte and then recover the original
file.
For those of you who use killfiles, I suggest adding an entry. Beyond that, please don't feed the troll.
-- Keith Thompson (The_Other_Keit h) ks***@mib.org <http://www.ghoti.net/~kst> San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst> We must do something. This is something. Therefore, we must do this.
"Antonio Contreras" <an*****@gmail. com> writes: Keith Thompson wrote:
[snip] It's not C, it's off-topic, and it's certainly total nonsense.
Fixed the above sentence. No compression algorithm (known or unknown) can compress *any* file to just one byte and then recover the original file.
I wrote "it's almost certainly total nonsense". You deleted the word
"almost". You did say that you "fixed" the sentence, but please don't
alter quoted material without clearly indicating what you've changed.
I wrote "almost" because I hadn't taken the time to understand his
nonsense well enough to be certain about it. If you want to state
your own certainty, by all means do so in your own words.
(We've had people in this newsgroup deliberately alter quoted text, so
some of us are a little touchy on the subject.)
--
Keith Thompson (The_Other_Keit h) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Keith Thompson wrote: "Antonio Contreras" <an*****@gmail. com> writes: Keith Thompson wrote: [snip] It's not C, it's off-topic, and it's certainly total nonsense.
Fixed the above sentence. No compression algorithm (known or unknown) can compress *any* file to just one byte and then recover the original file.
I wrote "it's almost certainly total nonsense". You deleted the word "almost". You did say that you "fixed" the sentence, but please don't alter quoted material without clearly indicating what you've changed.
I wrote "almost" because I hadn't taken the time to understand his nonsense well enough to be certain about it. If you want to state your own certainty, by all means do so in your own words.
(We've had people in this newsgroup deliberately alter quoted text, so some of us are a little touchy on the subject.)
I apologize if my previous post went against this group's netiquette.
What I wanted to point is that it's not necessary to read the
pseudo-code in order to be able to say that it's nonsense. The claimed
effect is simply imposible. As a friend of mine says, "entropy is the
limit between compression and magic". The zeus compression algorithm
certainly falls into the category of magic.
"Antonio Contreras" <an*****@gmail. com> wrote in message
news:11******** *************@g 14g2000cwa.goog legroups.com... Fixed the above sentence. No compression algorithm (known or unknown) can compress *any* file to just one byte and then recover the original file.
Depends on the value of CHAR_BIT ;).
Alex
Alex Fraser wrote: "Antonio Contreras" <an*****@gmail. com> wrote in message news:11******** *************@g 14g2000cwa.goog legroups.com... Fixed the above sentence. No compression algorithm (known or unknown) can compress *any* file to just one byte and then recover the original file.
Depends on the value of CHAR_BIT ;).
xDDD
Well, in fact it doesn't. As long as CHAR_BIT remains finite such an
algorithm simply cannot exist.
Antonio Contreras wrote: Alex Fraser wrote: "Antonio Contreras" <an*****@gmail. com> wrote in message news:11******** *************@g 14g2000cwa.goog legroups.com... > Fixed the above sentence. No compression algorithm (known or unknown) > can compress *any* file to just one byte and then recover the original > file.
Depends on the value of CHAR_BIT ;).
xDDD
Well, in fact it doesn't. As long as CHAR_BIT remains finite such an algorithm simply cannot exist.
You're assuming that the universe contains unboundedly many bits.
--
Chris "bits and pieces of mind" Dollin
oxygen is a highly reactive waste-product of plant life. This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: c3poptuse |
last post by:
Supercomputer and encryption and compression @ rate of 96%
Take a document then or a 3D matrix document change it two random or
binary code or just a program for 0's and 1's and fold it over and over
like a piece of paper then having the 1 and 0 add each other or the
0,1's canceling each other out 1+0=0 and 0+1=1 1+1=1 0+0=0 if you gave
the...
|
by: Jim Hubbard |
last post by:
I went to the compression newsgroups, but all I saw was spam. So, I
thought I'd post his question here to get the best info I could from other
programmers.
Which compression algorithm offers the fastest compression of text data?
Which compression algorithm offers the best compression of text data?
I need to do in memory compression of...
|
by: dirgesh |
last post by:
I am having a hard time making a Program in C/C++ that uses the Huffman
Compression to compress a file.
I have a file "Hello World" That i need to compress.
can someone please give me an example of how to do it with huffman
compression.
|
by: TerryStone |
last post by:
Thanks to anyone who reads this.
Below is some C# that compresses an array of bytes, and then
decompresses, and compares the original data with the new.
Firstly, the length of the decompressed data is shorter than the
original. So some loss of data has occured. But the content up until
the early truncation matches. So am I flushing...
|
by: jeremyje |
last post by:
I'm writing some code that will convert a regular string to a byte
for compression and then beable to convert that compressed string back
into original form.
Conceptually I have....
For compression
string ->(Unicode Conversion) byte -(Compression + Unicode
Conversion) string
| |
by: =?Utf-8?B?VkJB?= |
last post by:
I compressed a file with GZipStream class and is larger than the original
file.... how can this be?, the original file is 737 KB and the "compressed"
file is 1.1 MB. Did i miss something or is normal with that compression class?
--
VBA
|
by: pamela fluente |
last post by:
I have been using something like:
public void SaveJPG(Image Image, string FileName, long
QualityLevel_0_100, long ColorDepthLevel)
{
ImageCodecInfo ImageCodecInfoJPG = GetEncoderInfo("image/jpeg");
EncoderParameters EP = new EncoderParameters(2);
EP.Param(0) = new EncoderParameter(Encoder.Quality,
QualityLevel_0_100);
EP.Param(1) = new...
|
by: Stephany Young |
last post by:
Does anyone have the source code for a C# implementation of the AR2000
Compression/Decompression algorithm that they might like to share?
|
by: csharpula csharp |
last post by:
Hello,
I would like to know which one of the following compressiom methods are
the easiest to implement in c# and the most effective one in compression
of files? (text or code files)
Which one of those: zip, tar, tar.gz, gz. ?
And is there any code sample in C# of the API with compression?
Thank you!
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it. ...
| |
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes...
|
by: TSSRALBI |
last post by:
Hello
I'm a network technician in training and I need your help.
I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs.
The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols.
I succeeded, with both firewalls in...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
|
by: 6302768590 |
last post by:
Hai team
i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
| |
by: bsmnconsultancy |
last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating...
| |