To telos ths 8ewrias Ypologismou

[Charalampos Gikas]

Mporw na pw oti yparxoun epishs mia programmatistikh glwssa gia ayto to
8ema... Thn perigrafw parakatw:


----------------------------------------------------------------------------
---------------------------------------------
Apo: http://www.elsop.com/wrc/humor/null_lan.htm

NULL - The Ultimate Computer Language
BASKING RIDGE, NJ - Bell Laboratories has formally announced what it
believes is the ultimate computer science language. Described by Iusi
Nogoto, the foremost Japanese fourth generation language expert, as "the
only truly elegant computer language ever devised." NULL, as it is known,
was developed by the same department that originally invented the wrong
number, the busy signal, and the phrase, "The number you have reached is not
in service."
NULL is the culmination of five years of work by a team of language
designers and computer science mathematicians. The final breakthrough
occurred when operating system expert Hugh Nicks suggested that if removing
GOTOs was good then why not scrap IF statements as well, since they usually
required typing too many characters anyway. This brilliant concept was
extended through a series of complex mathematical theorems that form the
basis of the NULL language.

Put in layman's terms by Sally Kahn-Vallee, electrical engineer and PROM
reader, "Like first we tossed out the bath water, then the baby, and like,
finally, the whole tub." The elegance and conciseness of NULL can thus be
proven to be a direct consequence of the fact that the language as defined
contains no statements at all. While at first glance this may seem a
drawback, in fact, it is a major improvement over any other language. A few
of the numerous reasons are:


  a.. Highly structured constructs.
  b.. Advanced data hiding techniques.
  c.. A NULL compiler can be written first in NULL without ever needing to
be written in a lower level language.
  d.. Since there are no statements to compile, in fact, no compiler need
ever be written in the first place, saving time and money.
  e.. Since there will be no compilers, no new releases will ever be issued
hence maintenance is reduced.
  f.. NULL programs are highly portable and totally machine independent.
  g.. NULL programs compile and execute rapidly. An important point to note
is that with the addition of a small amount of language dependent code, e.g.
PROC/END etc., all NULL programs can be compiled by any other language
compiler.
  h.. Since there will never be new releases of NULL, all programs are
upwardly and downwardly compatible.
  i.. NULL can be parsed top-down, bottom-up, left-right, right-left,
inside-out, and over-easy.
  j.. NULL programs are both self-documenting for clarity and
self-concealing for security.
  k.. NULL programmers are easy to find and once found can be fired since
they are not needed.
  l.. If desired, specialized NULL hardware could be designed implementing
the code in firmware. Of course, such hardware may require years of
development. One suggestion from Bell's VLSI experts Nora and Andy Gates was
to take an existing available chip and remove all the instructions except
NOP. While this should work in theory, they acknowledged that it is probably
not the most efficient implementation.
These are just a few of the many ways NULL is superior to all current
computer languages. You can, no doubt, think of more. For further reading
consult any of the numerous books and articles by Donald Knuth, David
Parnas, and of course, the basis of all modern computer language theory,
"The Emperor's New Clothes."

By John R. Andrews, University of Illinois at Chicago.




----- Original Message -----
From: "Stavros 0 Sahtouris" <saxtouri at csd.uoc.gr>
To: <ugrads at csd.uoc.gr>; <herlug at lists.hellug.gr>
Cc: <ggeo at csd.uoc.gr>
Sent: Sunday, January 27, 2002 5:31 PM
Subject: To telos ths 8ewrias Ypologismou


> X8es to bradu, meta apo mia-duo rakes, mou hr8e mia kataplhktikh idea pou
8a
> shmanei to telos ths 8ewrias upologismou kai 8a odhghsei pollous an8rwpous
> sthn autoktonia. Me thn idea mou auth mporoume na lusoume OLA ta
problhmata.
> To ennow.
>
> Oriste o arxikos mou sulogismos:
>
> 1. Kapoios zei gia na ma8ei gia pio logo zei
> 2. Dhladh, o logos gia ton opoio zei einai na brei ton logo gia ton opoio
> zei
> 3. An kapoios gnwrizei to (2), tote gnwrizei to logo gia ton opoio zei
> 4. Epomenws, me bash to 1, den uparxei logos na zei
>
> Me bash ton parapanw sulogismo, 8a eprepe na autoktonhsoume oloi? Oxi
> anagkasthka. Apla mporoume na zoume xwris logo.
>
> As doume, omws, to zhthma auto na efarmozetai ston programmatismo:
>
> 1. Kapoio programma trexei gia na brei to logo gia ton opoio trexei
> 2. Dhladh, o logos gia ton opoio trexei einai na brei to logo gia ton
opoio
> trexei.
> 3. An, me kapoio tropo, to programma gnwrizei to (3), tote exei brei to
logo
> gia ton opoio trexei.
> 4. Epomenws, me bash to (1) den uparxei logos na trexei allo.
> 5. Epomenws, termatizei.
>
> O parapanw sulogismos mas odhgei se isodunamous algori8mous me
poluplokothta
> O(1) pou lunoun KA8E problhma. Oriste kapoioi tetoioi algori8moi,
> ulopoihmenoi se kapoies dhmofileis glwsses:
>
>
>
> C/C++:
>
> int main(){
> exit(0);
> }
>
> ------------------
> Java:
>
> public class goal extends java.lang.oblect{
> public static void main(String[] args){
> System.exit(0);
> }
> }
>
> ------------------
> Python:
>
> def main():
> import sys
> sys.exit(0)
>
> ------------------
>
>