Complexity:

In his book "Computability and complexity - From a Programming Perspective" Neil D. Jones proves the following theorem (theorem 23.5.1 on page 346):
LOGSPACE \subseteq NLOGSPACE \subseteq PTIME \subseteq NPTIME \subseteq \PSPACE = NPSPACE and NLOGSPACE \neq PSPACE

pseudonym: Have you any references proving PTIME \subset EXPSPACE? Neil Jones doesn't even mentioning EXPTIME in his book.

Writing:
Finally wrote the first of a promissed serie of perl articles in danish. Soon we will have a set of danish perl tutorials not beginning with:

#!/usr/bin/perl

 print "Content-Type: text/html\n\n"

 print "Hello World\n"

I just hate people equalizing perl and CGI.