Donald Knuth — Computer Literacy Bookshops Interview (1993)

I've picked the following article from archive.org. It's no longer available at clbbooks.com. Knuth is the greatest geek that ever existed I guess; I can't say much more on him… I must commend his foresight on bioinformatics though :D, yet again testimony to his genius… May in silico biology thrive!

Donald E. Knuth

knuth1993.gif

Photo by Rachel Unkefer

December 7th, 1993

Donald E. Knuth, is considered by many to be the world's pre-eminent computer scientist. The first three volumes of The Art of Computer Programming, definitive reference works for almost 30 years, earned him the ACM's Turing Award in 1974 and the National Medal of Science in 1979. Knuth has also developed breakthrough applications in computer typesetting ("TeX" and "METAFONT") and software development ("WEB"), and has over 100 publications to his credit.

Now Professor Emeritus at Stanford University, Knuth is once again channeling his full energies into writing. Dan Doernberg interviewed him in December 1993 to see what he's been doing recently, and what we have to look forward to.


CLB: You have just-published books on both CWEB and the Stanford GraphBase, two areas of your own research. Let's start with CWEB, which integrates C and TeX to facilitate program documentation.

Knuth: The CWEB system is an add-on to C that makes programming better than any other method known in the world, by far. I simply have to be honest and say that it's the greatest thing that's there. The CWEB System of Structured Documentation is the definitive user manual and complete explanation, more than anybody really needs to know about CWEB.

CLB: You've said that CWEB gives an order of magnitude improvement in programmer productivity— how so?

Knuth: Well, maybe not an order of magnitude, maybe only a factor of two. People who have used CWEB have noticed that they write better programs, that the programs are more portable, more easily debugged, more easily maintained… and they don't take as long to write.

CLB: Has CWEB been used just at Stanford, or in industry as well?

Knuth: It's being used around the world. We've had WEB, the original version (for Pascal) in a variety of systems, and then more and more people started getting infected by it. TeX was written in WEB. Silvio Levy did the conversion to CWEB in 1987. It was experimental for a long time, and now I'm just saying "The experiment worked!". CWEB is much better than WEB, because C is a much nicer language to work with for system programming and lots of other things. For anybody who really cares about programming, I have no idea why they would not prefer this to any other system.

CLB: Easy to use, runs fast, all that good stuff?

Knuth: Right, and it makes you happy after you finish writing a program!

CLB: Even if you write a bad program?!

Knuth: Almost… well… yeah! Jill will tell you, I come out of my office several times a week saying, "CWEB programming is such fun!" It's true, I just can't do enough of it.

The frame of mind that you're in when you're writing a CWEB program is that much better than the old attitude. You think of yourself as writing for a human being, explaining to a human being what a computer should do, instead of thinking of yourself as talking to the computer telling it what to do. You get your act together better when you're explaining it to another person. This approach helps even for a program that you're going to throw away after an hour. CWEB is a tool that I recommend using even if you're writing a program only for yourself, for your eyes only.

CLB: CWEB seems very close to the structured programming models of the 70s…

Knuth: Right, it's the next step. With structured programming, there were some people saying program top-down, and others saying program bottom-up. With WEB/CWEB you can do parts of it bottom-up and parts of it top-down, whatever you feel is right for the program, or for the part of the program you're in.

The structured programming methodology was great… but the way to really understand it is not as a cookbook of rules, but as a way to understand the relation between high-level and low-level views of a program. The way you do that is by viewing the program as a web, as a bunch of small pieces that are simple in themselves and that have simple connections to other small pieces. This way of understanding the complex whole in terms of simple small parts, and the connections between those parts, is supported by the WEB scheme.

You can create the parts in whatever order is psychologically best for you. Sometimes you can create them from the bottom up. Bottom-up means that you know somehow that you probably need a subroutine that will do something, so you write it now while you're ready, while you're psyched for it. With this bottom- up programming, your pencil gets more powerful every page, because on page nine you've developed more tools that you can use on page ten… your pencil is stronger.

With top-down programming you start at the beginning and say "I'm going to do this first and then this, and then this"… but then you have to spell out what those are— you can wind up gasping for breath a hundred pages later when you finally figure out how you're actually going to do those things!

Top-down programming tends to look very nice for the first few pages and then it becomes a little hard to keep the threads going. Bottom-up programming also tends to look nice for a while, your pencil is more powerful, but that means you can also do more tricky stuff. If you mix the two in a good psychological way, then it works, even at the end.

I did this with TeX, a very large program: 500+ pages of code in the book . Throughout that entire program, all those lines of code, there was always one thing that had to be the next thing I did. I didn't really have much choice; each step was based on what I'd done so far. No methodology would teach me how to write a piece of software like that, if I followed it rigorously. But if I imagined myself explaining the program to a good competent programmer, all that this long program was, then there was just this one natural way to do it. The order in which the code appears in the book is the order in which I wrote it.

CLB: To what extent did you or do you follow the "holy war" debates about software engineering methodologies?

Knuth: I didn't follow every nuance of that work, but I was aware of the dominant ideas. I didn't know what the CASE tools were until many years after other people did. I think it was bad to make too much of a religion out of it. There was a lot of "political correctness" about how to program in those days.

There was a similar thing in the mathematics community in the 1920's, where people were saying that good mathematicians would have to prove theorems a certain way. You weren't supposed to use certain tools of proof that some people thought might lead you into paradoxes. It was like trying to do mathematics with a hand tied behind your back. Similarly, politically correct structured programming was keeping people from getting good programs done, when they knew perfectly well what they were doing, just because their approach didn't happen to fit with the current idea of correctness. Computer science is like every other field; it goes in waves of fashion. Some of the trends are good, but almost every good idea seems to get used in a different way than it should have been.

For example, take random number generators. People had no theory about how to generate random numbers for fifteen years. Then somebody proved one small result about a particular method: if you averaged the serial correlation over an entire period of a billion numbers, the average would be zero, which was good. All of a sudden, everybody switched over, they took out all their old routines and converted to this new method, because it was the only one that had any theory to it whatsoever. It turned out this was a horrible random number generator; the theory had not noticed that the average over the first half was +1 and over the second half was -1! All through history, people have taken ideas and misunderstood the limitations of them.

CLB: Which method was this?

Knuth: Well, it was called RANDU in most subroutine libraries. It's been pretty well purged by now; still, if anybody sees a subroutine named RANDU, get rid of it!

CLB: Did you integrate WEB with C because so many programmers today are using it, or do you personally like C and write with it?

Knuth: I think C has a lot of features that are very important. The way C handles pointers, for example, was a brilliant innovation; it solved a lot of problems that we had before in data structuring and made the programs look good afterwards. C isn't the perfect language, no language is, but I think it has a lot of virtues, and you can avoid the parts you don't like. I do like C as a language, especially because it blends in with the operating system (if you're using UNIX, for example).

All through my life, I've always used the programming language that blended best with the debugging system and operating system that I'm using. If I had a better debugger for language X, and if X went well with the operating system, I would be using that.

An extreme case occurred one year I worked in a lab where the operating system had been designed by Ned Irons. The system was for one of Cray's early machines, and Irons had also written a compiler language called IMP. IMP had a lot of horrible features. One, it was an extensible language, and everybody in the lab would keep extending it. A program that worked on Monday wouldn't work on Tuesday, and the first thing that you'd do if your program failed was to check whether the compiled code was OK. The second thing about IMP was that it was an extremely terse language. For example, where in PASCAL you would say "IF X > 0 THEN…", in IMP you say "X+=>". In other words, your program was very short. You felt like you were writing elegant programs, because there were only a few characters, but you couldn't read them the next day! Being very terse meant that you couldn't fathom this bunch of marks on the page…

CLB: I realize your current emphasis is on "literate programming", but were you ever whatsoever attracted to APL as a math-oriented language?

Knuth: That's another story. APL is for people who have problems to solve and don't care too much about efficiency; they want a nice elegant way to state the solution to their problem, but the solution that they come up with is not necessarily anything that a computer has an easy job doing. It's a problem specification language, but not a system programming language… there is an APL-WEB.

But I want to say more about IMP. The third thing against it was, if you made a mistake, the compiler would either get into an infinite loop, or it would stop on your first error and say "ERROR ERROR ERROR" and quit; you would have to figure out what the mistake was! It was not a great language or compiler.

However… it was still my language of choice, because it fit that operating system perfectly. The arrays would be named in a way that you could easily see in the debugger, and you could know where the storage was being allocated, you knew what was going on, and you could actually get your program running reliably, because IMP blended with the operating system. You couldn't do that with any of the other languages. You might be writing with a better language, but you would get your work done a couple of weeks later, instead of getting answers. I used IMP.

CLB: Was IMP being used at Stanford?

Knuth: It was at a research lab in Princeton. A year before I came to Stanford, I worked there on a classified cryptanalysis research project.

CLB: Please tell us about your other new book, The Stanford GraphBase.

Knuth: The GraphBase book is for two kinds of people. It has a research purpose; the people who are working on the study of new algorithms for combinatorial problems need a standard set of test data on which to compete with each other, and for benchmarks. As I was preparing Volume IV of The Art of Computer Programming, I decided that I would make all the examples and data that I'm using in that book available to everyone. There was a need for some standard benchmarks, and everything should be well arranged so that it is easy to use in thousands of ways. So… I now have a collection of thousands of standard data sets; anyone in Poland can have exactly the same data as anyone in California or China. It's very portable, and can be downloaded from the Internet.

The second purpose of the GraphBase hook is that it is an example of CWEB programming— it's actually 32 examples of CWEB programming. They're short programs that illustrate the programming style that I prefer. The examples are like little essays, little short stories of computer programs, that are perhaps fun to read.

CLB: What is your current hardware and software environment?

Knuth: I use CWEB for my programming. I use the Emacs editor very heavily, and I use a great high-level language called METAPOST for drawing technical illustrations. This is a new language by John Hobby that is going to be released soon, I think. It's based on METAFONT. 75% of the code is mine from METAFONT, but it's fixed up so that it generates PostScript. I love it.

I also use Mathematica. The people at Maple are trying to convince me to switch over to Maple, another excellent system. At the moment, I like Mathematica because you don't have to type your multiplication signs; you can say "2X" instead of "2*X". Also, the Mathematica manual is exceptionally good.

CLB: You like Wolfram's writing style?

Knuth: Especially the index… you can easily find your way around that book. With the first edition, when I had a new problem to solve, I would look in the index and it would almost always refer me to the right page. There were three or four times when the word I tried wasn't there, and I penciled in where to look when I had this problem next time. In the second edition those had all been fixed, and I had not reported them to anybody.

CLB: Let me get your quick impressions on a few research areas, and whether you've read or done any work in them. The first is genetic algorithms. How do you feel about the general concept, that instead of the human determining the algorithm, you somewhat let the machine have at it…

Knuth: I plan to do a lot of experimenting on this as I get into Volume IV. There's genetic breeding, there's simulated annealing, there are other strategies that people have developed. I have a method in The Stanford GraphBase book that I call "stratified greed". These techniques are all competing for the same kind of problems, and I want to try a lot of examples; some of them might work better on one than the other, and I want to get a feel for this. Certain problems are naturals for neural nets… genetic algorithms are likely to do well on tasks related to language recognition, and people say also like predicting the stock market or something like that. Somehow the closer a problem is to nature, the more you expect the genetic algorithm to work, while the closer it is to number theory or something artificial, the more you expect some other kind of approach will help. It's hard to understand the way these methods scale up; on a small problem they might do terrifically, and then they might break down completely just when the problem gets a little bit bigger… or it might go the other way.

CLB: It sounds like you have several years of disciplined testing with your data sets ahead of you.

Knuth: The Stanford GraphBase gives me an unlimited supply of problems that I and other people can do. I read what other people have claimed about their methods, but I also try them all myself. The original work I do in The Art of Computer Programming is to take the methods of two different authors and analyze method A from the standpoint of author B, and method B from the standpoint of author A. They have only given their sides of it, so I try to fill in ….

CLB: What about object-oriented programming? Is it just a current buzzword, or does this approach appeal to you?

Knuth: I've always thought of programming in that way, but I haven't used languages that help enforce the discipline; I've always enforced the discipline myself in other languages. Programming languages can now catch you if you make a mistake, and they make it easier for you to hide information from one part of the program to another. In my own programs, with older languages, I wouldn't use what I wasn't supposed to use; I would have to discipline myself to follow these rules. I could, so I did. There weren't programs I couldn't write… but the new tools do help.

The problem that I have with them today is that… C++ is too complicated. At the moment, it's impossible for me to write portable code that I believe would work on lots of different systems, unless I avoid all exotic features. Whenever the C++ language designers had two competing ideas as to how they should solve some problem, they said "OK, we'll do them both". So the language is too baroque for my taste. But each user of C++ has a favorite subset, and that's fine. CWEB fully supports C++ as well as C.

CLB: What are your thoughts about chaos theory, fractals, those areas? Their indeterminateness seems a little discordant with the domains you've focused on in the past.

Knuth: I did some early work with fractals and so on, and I think it's a great new abstraction. People can build models that they wouldn't have thought of building before, that really match a lot of things in nature that have this character of looking the same when you change the scale. You know, if you magnify the coastline, it still looks like a coastline, and a lot of other things have this property. Nature has recursive algorithms that it uses to generate clouds and Swiss cheese and things like that. So now we have mathematical techniques for understanding such processes that go beyond the kind of differential equations that people used to have in previous centuries. Now we have a brand new tool to work with, but I'm not very intuitive about such methods. I know the limitations of my own intuition; I can solve some problems well, but I know other people are able to see something right away which takes me a long time… It's not my cup of tea.

CLB: To what extent have you ever followed developments in artificial intelligence? The third program you ever wrote was a tic-tac-toe program that learned from its errors, and Stanford has been one of the leading institutions for AI research…

Knuth: Well, AI interacts a lot with Volume IV; AI researchers use the combinatorial techniques that I'm studying, so there is a lot of literature there that is quite relevant. My job is to compare the AI literature with what came out of the electrical engineering community, and other disciplines; each community has had a slightly different way of approaching the problems. I'm trying to read these things and take out the jargon and unify the ideas. The hardest applications and most challenging problems, throughout many years of computer history, have been in artificial intelligence— AI has been the most fruitful source of techniques in computer science. It led to many important advances, like data structures and list processing… artificial intelligence has been a great stimulation. Many of the best paradigms for debugging and for getting software going, all of the symbolic algebra systems that were built, early studies of computer graphics and computer vision, etc., all had very strong roots in artificial intelligence.

CLB: So you're not one of those who deprecates what was done in that area…

Knuth: No, no. What happened is that a lot of people believed that AI was going to be the panacea. It's like some company makes only a 15% profit, when the analysts were predicting 18%, and the stock drops. It was just the clash of expectations, to have inflated ideas that one paradigm would solve everything. It's probably true with all of the things that are flashy now; people will realize that they aren't the total answer. A lot of problems are so hard that we're never going to find a real great solution to them. People are disappointed when they don't find the Fountain of Youth…

CLB: If you were a soon-to-graduate college senior or Ph.D. and you didn't have any "baggage", what kind of research would you want to do? Or would you even choose research again?

Knuth: I think the most exciting computer research now is partly in robotics, and partly in applications to biochemistry. Robotics, for example, that's terrific. Making devices that actually move around and communicate with each other. Stanford has a big robotics lab now, and our plan is for a new building that will have a hundred robots walking the corridors, to stimulate the students. It'll be two or three years until we move in to the building. Just seeing robots there, you'll think of neat projects. These projects also suggest a lot of good mathematical and theoretical questions. And high level graphical tools, there's a tremendous amount of great stuff in that area too. Yeah, I'd love to do that… only one life, you know, but…

CLB: Why do you mention biochemistry?

Knuth: There's millions and millions of unsolved problems. Biology is so digital, and incredibly complicated, but incredibly useful. The trouble with biology is that, if you have to work as a biologist, it's boring. Your experiments take you three years and then, one night, the electricity goes off and all the things die! You start over. In computers we can create our own worlds. Biologists deserve a lot of credit for being able to slug it through.

It is hard for me to say confidently that, after fifty more years of explosive growth of computer science, there will still be a lot of fascinating unsolved problems at peoples' fingertips, that it won't be pretty much working on refinements of well-explored things. Maybe all of the simple stuff and the really great stuff has been discovered. It may not be true, but I can't predict an unending growth. I can't be as confident about computer science as I can about biology. Biology easily has 500 years of exciting problems to work on, it's at that level.

CLB: Use of the Internet is exploding right now, with everyone getting on…

Knuth: Some day we are going to try to figure out who is paying for it!

CLB: Do you currently use it? I know you did in the past.

Knuth: I spent fifteen years using electronic mail on the ARPANET and the Internet. Then, in January 1990, I stopped, because it was taking up too much of my time to sift through garbage. I don't have an email address. People trying to write me unsolicited email messages get a polite note saying "Professor Knuth has discontinued reading electronic mail; you can write to him at such and such an address."

It's impossible to shut email off! You send a message to somebody, and they send it back saying "Thank you", and you say "OK, thanks for thanking me…"

Email is wonderful for some people, absolutely necessary for their job, and they can do their work better. I like to say that for people whose role is to be on top of things, electronic mail is great. But my role is to be on the bottom of things. I look at ideas and think about them carefully and try to write them up… I move slowly through things that people have done and try to organize the material. But I don't know what is happening this month.

So now I don't read electronic mail, but I do use it occasionally. Say I'm taking a trip to Israel and I've got to make last minute arrangements. When I visit another university or research center for a few days, I have to send email from there. I've learned how to use the email facilities in Emacs, but I don't want to get good at it.

CLB: You have many interests outside of computing and mathematics— music, religion, writing. Is music a creative outlet for you, a means of recreation, or a spiritual outlet?

Knuth: At the moment it's recreational. I like to have friends come to the house and play four-hands piano music. If I could do it every week, I would. I hope to live long enough so that after I've finished my life's work on The Art of Computer Programming, I might compose some music. Just a dream… it might be lousy music, of course.

CLB: You have written some compositions already, haven't you?

Knuth: Yeah, but it was mostly arrangements of other people's themes. I did write a short musical comedy when I was in college called "Nebbishland". Remember how Nebbishes were all the rage in the late 50s? "Nebbishland" was only about a ten minute skit, but it was all original music and lyrics.

CLB: Do you have the score somewhere in the attic?

Knuth: Yeah… no actually, I think I've lost it. I have only part of it. I'm hoping to come across it. I'm going through my files now and making a computer index of everything I have in the house.

CLB: Sounds like you don't have a paperless house!

Knuth: No!

CLB: Have you fiddled with MIDI computer technology for music, or have you purposely stayed away from it?

Knuth: I have fun with it. I bought a synthesizer for my son last Christmas, and I played it for hours and hours. I loved it. I had once played on a Kurzweil synthesizer years ago, at Marvin Minsky's house, a grand piano imitation. More recently, a friend went to England for three years and didn't want to bring his grand piano him, so he bought a Yamaha with six voices. When I visited his house, I had a tremendous time for three days going through all of the pieces I'd learned on the piano, playing them as if they were on vibraphone, or on a harpsichord, or some other voice. His "piano" has a harpsichord voice, but the keyboard is pressure-sensitive, so you can play loud and soft, which you can't do on a real harpsichord. These synthesizers are great.

CLB: When did you retire from Stanford?

Knuth: This year. I was on leave for two years until I could officially retire. Unofficially, I retired in 1990, on the same day I gave up email. I announced my plans three years earlier. I realized that my main goal in life was to finish The Art of Computer Programming; I had looked ahead and seen that it would take twenty years of work, full-time. If I continued doing everything else that I was doing, it was going to be forty or fifty years of work. I was just not getting anywhere, I was getting further and further behind. So I said, "Enough." Naturally, I hate to give up many of these other things that I like doing very much. But there are some things I didn't hate giving up, like writing proposals. I'm very happy to give up those!

CLB: You had to write proposals?? I assumed you were insulated from that somehow.

Knuth: You've got a great sense of humor! I don't have to do it anymore; but as a professor, in order to have decent equipment for my grad students, or to have visitors for active research programs, to publish reports, etc., I needed to find sponsors. It's a lot of work begging for money. The System Development Foundation said they'd give me a million dollars so that I could finish TeX and get back to The Art of Computer Programming.

CLB: Did you take them up on it?

Knuth: Sure, but it still took many, many years to finish TeX. I decided that the only way I would be able to finish The Art of Computer Programming is by going into full-time writing, and being a hermit, and telling people "No." It was hard to adjust the first couple of years. Now I feel real efficient, and the writing is going well. A nice steady state.

I give lectures at Stanford every month or so, when I'm in town, called "Computer Musings". I plan to keep this up for twenty years, to give a talk on whatever I find interesting that month, on neat ideas I've picked up… I bring up problems that I can't solve, so that somebody will do it for me. Now, if I can't solve a problem in two hours, I've got to give it up and tell somebody else to work on it; otherwise, I'll get behind again. As I write the book, I've got to move from topic to topic, and my attention span is maybe three weeks on any particular topic.

CLB: You're best known for your writing and research; did you enjoy teaching and the interaction with students?

Knuth: We had the greatest students in the world. I can still get together with students through my lecture series, except I don't know their names anymore. That's a problem.

CLB: No student interns?

Knuth: Suppose I give a "Computer Musings" lecture, stating an open problem, and suppose that a student in the audience solves that problem, writes his thesis and finishes it in the next two weeks (maybe two and a half), and shows it to me. Then I'd still be interested in the topic, would still read it, and I'd be glad to sign his thesis… but that's the only way. 28 is the total number of Ph.D. students I've had graduate, and that's probably all that I will have… unless something happens at high speed through the "Computer Musings".

CLB: Real-time Ph.D.'s! What changes have you seen in the students coming into the computer science program over the years?

Knuth: There is a very profound change that I can't account for. In the 70s, the majority of our students were very interested in music. The first thing we'd ask them when they came in was "What instrument do you play?" We had lots of chamber groups and so on. Now almost none of the students are interested in music. I don't know if it's because a different kind of people are enrolling in computer science, or because it's true of all today's students, or what. If you ask computer science students now what their hobby is, the chances are most of them will say "Bicycling". I recently had one who played a harmonica, but there were almost no musicians in the group.

CLB: Any changes in the quality of the students?

Knuth: Not the quality… but they don't know as much about mathematics as they used to. We have to do more remedial stuff in college, even at a school like Stanford.

CLB: How about changes in the field itself… with so much progress and so many more people involved, is computer science today very different than it was earlier?

Knuth: Well, there's all the media and the visual things, that's a lot different than it was. There's also the competition; it's a great deal more difficult now than it was in my day. When I started, it was so easy to come up with something new compared to now, when you've got thousands and thousands of smart people all doing great stuff. There might have been ten great Ph.D. theses a year at one time; there's just no way to keep up with all the stuff now.

No matter what field of computer science you're in, everyone is finding it hard to keep up. Every field gets narrower and narrower, since nobody can cover all the territory anymore. Everybody can choose two small parts of computer science and learn those two parts; if one person knows parts A and B, another knows B and C, and another knows C and D, the field remains reasonably well connected, even as it expands.

CLB: Do you see yourself as one of the last of computer science's "Renaissance Men"?

Knuth: I'm not as broad as you might think— I only work on one thing at a time. I guess I'm a quick study; I can become an instant expert in something. I've been collecting stuff for thirty years so that I can read the literature on each topic in "batch mode"— not swapping lots of different topics in and out. I can absorb a subject locally and get good at it for a little while… but then don't ask me to do the thing I was doing a few months ago! Also, I have lots of people helping me correct my mistakes.

CLB: My last question, your least favorite to be asked… what is the current plan for completing all seven volumes of The Art of Computer Programming?

Knuth: I'm going to have fascicles of about 128 pages coming out twice a year. We're gathering four of them before we come out with the first two actually; we're going to keep some in the pipeline! Look for the first fascicles in 1995 or 1996; they will be beta-test versions of the real books. I'm thinking I can finish Volume IV (parts A, B, and C)in the year 2003, Volume V in 2008, then come out with new editions of Volume I, II, and III, then work on VI and VII… There will be a "Reader's Digest" version of volumes I through V.

CLB: What would your career, and life, have been like had you not announced the 7-volume set?

Knuth: Oh, I didn't announce it at first. I thought I was writing only one book. But if I hadn't done that, I suppose I still would have been doing a lot of writing. Somehow it seems that all the way through, I've enjoyed trying to explain things. When I was in high school, I was editor of the student paper; in college I edited a magazine. I've always been playing around with words.

Courtesy: Computer Literacy Bookshops, Inc.

The following file may be copied or distributed freely, as long as it is distributed in its entirety. This file is copyright 1993, Computer Literacy Bookshops, Inc. No use or excerpt may be made of the file without acknowledgement of its source.

Burning visible images onto CD-Rs with data (beta)

“By carefully choosing the right 1s and 0s to burn to a CD, it is possible to burn visible images on normal CD-Rs. These images rely on the fact that the 1s and 0s created by pits in the CDs surface reflect light differently…”

This is just insane!

There are even MATLAB programs etc on the website to help you do the same!
What an innovative idea! Remember, this is nothing to do with the Lightscribe kind of stuff… since Lightscribe requires special media…

Read more at Instructables: http://www.instructables.com/ex/i/6227EC9EE1DB1028ABAA001143E7E506/?ALLSTEPS

read more | digg story

Google News gets foiled by 15-year old Vandetta

Tom Vandetta found an article that explained how to fool Google’s news system by writing fake press releases. He then decided to see what would happen if he submitted a fake Google press release claiming the 15-year old New Jersey student was Google’s youngest employee.

The press release was issued through the free service I-Newswire and contained a number of spelling mistakes. Short and to the point, the release, which appeared to have been sent by a Google spokesperson Sonya Johnson (who’s actually existence is unconfirmed and is assumed to be imaginary), read:

“(I-Newswire) – 15 year old student, Tom Vendetta has been hired by search engine giant Google Inc. The student will receive a lowered salary, which will be placed into a bank account for future education, said Google CEO Larry Page. When asked what role Vendetta will play at the Tech Giant’s offices, Page said he wouldnt have a role at the Main Offices. Instead he would work from his home in the New Jersey suburbs. Vendetta will be incharge of working with recent security flaw’s in Google’s beta e-mail service, “Gmail”. Google said they first found out about him when they discovered the student’s blog, at http://tomvendetta.be. The media giant said they looked forward to working with Vendetta’s expertise in JavaScript and AJAX.”

A few hours after posting the fake press release, Vandetta logged into the news search tool Digg after receiving an automated email from MAKEBot (Digg’s Spider), to find his practical joke had become a credible international tech story. Google was even displaying reference to the press release in Google News and at in the news results placed above search results relating to Google employment or hiring. According to his confessional blog posting, “At that moment, I felt my stomach knot up and my heart drop. I knew exactly what happened and knew that I would end up regretting posting that.”

The prank has made Vandetta temporarily famous. His Gmail account received almost 400 emails in the first few hours. Vandetta has since had to open new Gmail and MySpace accounts. His parents are changing their phone number and he is working to re-establish a workable online identity. On the brighter side, he has received a few emails from Google employees assuring him he has not dashed his dreams of one day working for Google, as he thought he might have.

Courtesy: digg, http://news.stepforth.com/blog/2006/03/google-news-credibility-foiled-by-15.php

Quite amusing!

read more | digg story

π day

π = 3.14159 26535 89793 23846 26433 …

3.14 = March 14 happens to be pi-day every year. Curiously enough, it also happens to be Einstein’s birthday!

http://www.angio.net/pi/bigpi.cgi gives you a search engine to search for digits of π. For example, a search for 15081947 gives

“The string 15081947 occurs at position 604,341 counting from the first digit after the decimal point. The 3. is not counted.

The string and surrounding digits:

99538905839657483550 15081947 01003364946075415680″

If you are quite crazy about π, you might want to pick up this geeky T-shirt (I created something very similar on photoshop, yet to print it!) from thinkgeek.

Indeed an enigmatic constant!

Interesting Google Links

read more | digg story

This page is in a wonderful language :D
http://www.google.com/intl/xx-hacker/why_use.html

Further, last April 1, google came up with this fantastic page:

Quench your thirst for knowledge.

At Google our mission is to organize the world’s information and make it useful and accessible to our users. But any piece of information’s usefulness derives, to a depressing degree, from the cognitive ability of the user who’s using it. That’s why we’re pleased to announce Google Gulp (BETA)™ with Auto-Drink™ (LIMITED RELEASE), a line of “smart drinks” designed to maximize your surfing efficiency by making you more intelligent, and less thirsty.

Think fruity. Think refreshing.

Think a DNA scanner embedded in the lip of your bottle reading all 3 gigabytes of your base pair genetic data in a fraction of a second, fine-tuning your individual hormonal cocktail in real time using our patented Auto-Drink™ technology, and slamming a truckload of electrolytic neurotransmitter smart-drug stimulants past the blood-brain barrier to achieve maximum optimization of your soon-to-be-grateful cerebral cortex. Plus, it’s low in carbs! And with flavors ranging from Beta Carroty to Glutamate Grape, you’ll never run out of ways to quench your thirst for knowledge.

red_200.jpgwhite_200.jpgpurple_200.jpgorange_200.jpg

How to get Gulped?
You can pick up your own supply of this “limited release” product simply by turning in a used Gulp Cap at your local grocery store. How to get a Gulp Cap? Well, if you know someone who’s already been “gulped,” they can give you one. And if you don’t know anyone who can give you one, don’t worry – that just means you aren’t cool. But very, very (very!) soon, you will be.

More on google gulp at google.

Further, last August, ONION came up with this hilarious article, spoofing the google enthusiasm:

Google Purge

Executives at Google, the rapidly growing online-search company that promises to “organize the world’s information,” announced Monday the latest step in their expansion effort: a far-reaching plan to destroy all the information it is unable to index.

“Our users want the world to be as simple, clean, and accessible as the Google home page itself,” said Google CEO Eric Schmidt at a press conference held in their corporate offices. “Soon, it will be.”

The new project, dubbed Google Purge, will join such popular services as Google Images, Google News, and Google Maps, which catalogs the entire surface of the Earth using high-resolution satellites.

As a part of Purge’s first phase, executives will destroy all copyrighted materials that cannot be searched by Google.

“A year ago, Google offered to scan every book on the planet for its Google Print project. Now, they are promising to burn the rest,” John Battelle wrote in his widely read “Searchblog.” “Thanks to Google Purge, you’ll never have to worry that your search has missed some obscure book, because that book will no longer exist. And the same goes for movies, art, and music.”

“Book burning is just the beginning,” said Google co-founder Larry Page. “This fall, we’ll unveil Google Sound, which will record and index all the noise on Earth. Is your baby sleeping soundly? Does your high-school sweetheart still talk about you? Google will have the answers.”

Google executives oversee the first stage of Google Purge:

purge.jpg

Read more at ONION.

Search engine wars…

We all use search engines several times a day, left, right and centre. Most of us use our favourite engine, which is most likely Google, and are happy with the results it fetches. But the fact remains that, particularly considering the disconnectedness of the web, we’re indeed missing out on several results. Popular things — people, companies, search engines — always have to pay a price. Just like most of the viruses are written for windows, most of the search engine hacks are targetted at Google.

As a simple example, a search for miserable failure leads you to Biography of President George W. Bush (also by searching for failure) and Biography of Jimmy Carter! This is a typical example of a googlebomb:

“A Google bomb or Google washer is a certain attempt to influence the ranking of a given page in results returned by the Google search engine. Due to the way that Google’s PageRank algorithm works, a page will be ranked higher if the sites that link to that page all use consistent anchor text. A Google bomb is created if a large number of sites link to the page in this manner. Google bomb is used both as a verb and a noun.”
Wikipedia entry on Google Bomb.

Wikipedia has an entry on miserable failure, as well.

It’s no big deal that a search for failure pops up such a result, since you are quite unlikely to google for such terms. But it clearly emphasises the fact that, despite spam filters etc, it is still likely that you end up seeing results that really do not matter to you in the context of your search. Note context.

That brings me to the point of clustering search engines. Considering how big Yahoo! powered by Inktomi was, it was indeed foolhardy to venture to build another search engine, but that’s what great technology can do, and we end up with a legendary Google. The next burning question is to question the hegemony of Google. Every newcomer probably now builds on the google experience of having an extremely uncluttered start page. So that’s good. Next, they try various other things, one of them being clustering. Clustering is certainly useful for disambiguation (you’ve seen this term often if you regularly use wikipedia!). Searching for ‘Cricket’ would give you entries on the game as well as the insect, certainly more of the former, and you would be hard-pressed to find entries on the latter! Cricket is perhaps a wrong example, in that the entries are just so many, that the game bulldozes the insect out of the search engine!

Vivisimo is a clustering search engine, that does a decent job.

tm.gif main_logo.gif

Previewseek (“the world’s most advanced search engine” is their slogan) is a very very good looking search engine, that throws up quite interesting results. For example, a search for cricket directly gives you several useful links. It already says at the top that “Previewseek know this about cricket …” at the top, which would be of great use if you are looking to understand a term or search (I almost said google!) for information about something. The wikipedia entry for cricket is also on the first page. It does use some bandwidth by displaying screenshots for the pages (the parent page of the page you wish to see, I feel), but for broadband users, that’s nothing to worry; you can preview a page before you jump into it. It looks a bit of an AJAX-type interface that’s cool and allows you to add search terms based on the results (a plus next to India, in cricket results , when clicked, will take you to cricket india results). Google does not give the wikipedia entry for cricket in its search, in the top ten. In fact, it’s at a rather bad 34 on the results list!

While I am on the topic of result ranks, I must mention this website, synerge, which compares the ranks of the results between Yahoo! and Google:

yahoo-vs-google1.jpg

PageRank is good no doubt, but spamming etc has its effects on it. I am certain that any algorithm for search, by definition, can be tricked. It’s just like encryption: no key is unbreakable (I’ll ignore quantum cryptography for the moment!). However, 1024-bit encryption does offer practically foolproof security. It’s just that we must continue to strive for such a search algorithm, that is practically foolproof.

There’s another search engine Kosmix, and this is what they have to say about themselves:
kosmix_logo.gif

“At Kosmix, we’re passionate about building a world class search engine that lets people search less, and discover more great stuff. There are billions of pages on the web that are useful, but never see the light of day through a standard search engine. We want to help you find those great pages, and make it easy and fun to do in the process.

Right now we’re in the early stages of Kosmix, and at this point only cover a handful of categories. Our list is growing fast, so check back with us to see what’s new.”

While Google searches pages based on popularity; Kosmix promises to work differently, and will have categorization based on content. With Kosmix, users will be asked to define a search category, and the search engine will then find Webpages that are closely associated in meaning with the search term. Kosmix – which has already started testing a health search on its website, will launch several other search categories over the next year.

The puropse of this article is just to make sure you have an eye on other search engines, including MSN, and not blindly run behind Google, however difficult that may be. None of them is way behind the other, except in popularity! Of course, I’d use Google Scholar ahead of any other search engine, but even there, there’s Entrez PubMed (or HubMed), Scirus and the like which are quite good.
The race is well and truly on, and we, as consumers, are in for a treat, for the problem of plenty is good to have!

lo and behold, logogle!

k0l.gifa3.gifr0.gift2.gifh2.gifi0.gifk2.gif
So how does that look? It’s pretty much trivial to do such a thing even in photoshop — I forget the site which gives the “How to” for that — but I generated is pretty much simple on logogle. Can’t see why anyone would want to use this, but it does look cool if you want to put up a funny-ish logo!

Google also comes up with a lot of cool logos — I wonder if any site has caches of those.. For example, on Independence Day (Aug 15, yeah!), google.co.in had a cool logo, with two Ashoka chakras instead of the two O’s in google! I’ve got one with a double helix though, which google uses in its site-flavoured searches. The google logo in itself is much a statement of its simplicity! Staying on the topic of design, there’s a graphic designer who believes that google could be a little more efficient (and beautiful?)! Read more about that here.

Update (2005-02-04 1027):

Googled and found the I-Day logo:

india05.gif

Gates too rich for tax computer to handle

Bill Gates, the world’s richest man, said the tax office in the US has to store his financial data on a special computer because his fortune is so vast.

“My tax return in the United States has to be kept on a special computer because their normal computers can’t deal with the numbers,” he said at a Microsoft conference held in Lisbon.

“So I am constantly getting these notices telling me I haven’t paid something when really it is just on the wrong computer,” he added in comments broadcast on television.

“Then they will send me another notice telling me how bad they feel they that they sent me a notice that was a mistake,” he said

Gates’s fortune is put at 47 billion dollars (38.9 billion euros), according to the latest list of the world’s rich published by Forbes magazine.

Last month Time magazine named Gates and his wife Melinda, along with rock star Bono, its “Persons of the Year” for 2005, citing their charitable work and activism aimed at reducing global poverty and improving world health.

The couple’s Bill and Melinda Gates Foundation has a 29 billion dollar endowment making it the world’s biggest charity.

Courtesy: http://news.yahoo.com/s/afp/20060131/od_afp/uspeoplegatestax_060131213459

I wonder what kind of a small variable they must have allotted for the calculations? Or is Gates breaching the 32 bit barrier? Maybe they should get to double data for calculations and ‘approximately’ tax Gates!! Can’t see how ‘salaries’ could ever trouble even a 32-bit computer?! I guess that’s another reason to hire Indian programmers… or maybe Microsoft could provide an open-source tax software to the US Government. Closed source, and maybe it’ll tax Gates less :D

Tagging, the next big thing?

From wordpress to flickr to del.icio.us and connotea, tagging appears to have caught on, not to mention labels in GMail. It’s not a ground breaking innovation, but a very ‘google-ish’ intelligent extension to an exisiting domain. Online bookmarking does seem interesting in that it’s great to share bookmarks. This is particularly useful in research, as you could see in connotea, an initiative of the Nature Publishing Group (NPG). It’s easy to surf users with similar tags, find related papers to the ones you are concerned with and so on.

I guess tagging is here to stay, just as I tag this post with it’s categories, being Technology and Software and Computers.