Peter Naur Wins 2005 Turing Award 135
An anonymous reader writes "The Association for Computing Machinery (ACM) has named Peter Naur the winner of the 2005 A.M. Turing Award. The award is for Dr. Naur's fundamental contributions to programming language design and the definition of Algol 60, to compiler design, and to the art and practice of computer programming. The Turing Award is considered to be the Nobel Prize of computing, and a well-deserved recognition of Dr. Naur's pioneering contributions to the field."
Datalogy (Score:5, Interesting)
Algol 60 Group (Score:2, Interesting)
Danes everywhere... (Score:4, Interesting)
The Algols were good (Score:2, Interesting)
In almost 40 years since the Algol family of languages was defined, we haven't really moved things along all that much. Quite a lot of the "improvements" in modern languages are not fundamental but largely aesthetic. Pretty pathetic really.
Nearly 4 decades ago, we programmed in Algol 68 and we walked on the moon. It's curious how the pace of progress in both realms slackened off quite suddenly, to put it generously.
Re:Nobel Games (Score:2, Interesting)
Honest question from curious geek- (Score:2, Interesting)
In 1952, Turing was convicted of acts of gross indecency after admitting to a sexual relationship with a man in Manchester. He was placed on probation and required to undergo hormone therapy. When Alan Turing died in 1954, an inquest found that he had committed suicide by eating an apple laced with cyanide.
Then the article mentions an urban legend:
In the book, Zeroes and Ones, author Sadie Plant speculates that the rainbow Apple logo with a bite taken out of it was an homage to Turing. This seems to be an urban legend as the Apple logo was designed in 1976, two years before Gilbert Baker's rainbow pride flag.
Urban Legend? Anyone have any more info on this?
In case you haven't seen it in a while, here is the classic Apple logo:
http://www.jeb.be/images/Apple/apple_logo_(640x48
Re:Honest question from curious geek- (Score:4, Interesting)
Re:Took a while, didn't it? (Score:2, Interesting)
Re:There is a saying... (Score:3, Interesting)
string* strcat(string *str1,string *str2){
if(str2.length+str1.length>str1.size){
if(reallocstr(dst,str2.length+str1.length)==ALLOC
return NULL;
}
}
memcpy(str1.buffer+str1.length,str2.buffer,str2.l
return str1;
}
Where string is a struct defined by the library. If you're using the plain C string library, that in itself is a problem- you're right, using it is slow and requires you to keep track of too much stuff. So don't-- use a better string library. There's a few dozen in C you can download off the web.
So why don't you write a list library that takes a function pointer and calls it on each member of the list? Or one that at least has functions so you can look like this (assume a list of ints for the following example):
for(int iter=begin(list);iter!=end(list);iter=getnext(lis
int val=getval(list,iter);
}
Your problem doesn't seem to be C, its using C poorly. If you're not doing stuff like this, you're working at the wrong level of abstraction. That leads to slow to write, buggy code in any language. And its equally likely in any language.
Re:Took a while, didn't it? (Score:2, Interesting)
Re:Datalogy (Score:2, Interesting)
The Naur frame is an A4 sized piece of cardboard with a hole in it like a picture frame. When he would read and grade a report he would place this frame over the report when reading it. So if your margin was too narrow the frame would cover some of your text. He would then give you a horrible grade because your report didn't make any sense.
A rather hard way to force people into having large margin, but also quite funny.
Naur denies having contributed to BNF (Score:4, Interesting)
Re:Some contributions of Algol60 (Score:3, Interesting)
Re:Datalogy (Score:2, Interesting)