April 21, 2007

Meta-meta-STOC/FOCS comments.

My responses to Bill Gasarch's questions in response to reader comments about STOC and FOCS (and theory conferences more generally):

Is the community really driven by these conferences?

That depends on how you define “the community”, doesn't it. If you mean the people that regularly attend and publish in and review for FOCS and STOC, then no, they drive the conference, not the other way around. If you mean the slightly larger community of people who want to reguarly publish in STOC and FOCS—either out of real interest or pressure from hiring/tenure committees—then yes, somewhat. If you mean the even larger community of theoretical computer scientists, then no, not at all. The community members who don't fit into the STOC/FOCS subcommunity have their own venues, their own peers, their own values.

Is it bad that we are so judged?

I don't understand the question. How are we so judged?

Other fields do not have high-prestige conferences—why do we and is it a good thing?

It's neither “good” nor “bad”. It is what it is—a generally healthy but imperfect social agreement that evolved with the research community. Of course different communities have different avenues for communication.

Are the papers [at STOC and FOCS] mostly good?

Yes. Mostly. Except for the ones that aren't.

Is there a Name-School-bias? Is their a Name-person-bias? Some have suggested anonymous submissions to cure this problem.

Don't confuse correlation with causality. STOC and FOCS have a high-quality and cultural-conformity bias. People who consistently produce high quuality results that conform to community standards become Big Names. Schools that hire Big Names become Big Names themselves, so Big Name schools tend to hire and propmote Big Name people. The Big Names are the result of the quality bias, not the other way around.

In any research community, people are more willing to believe results from Big Names without reading their papers in detail than from random n00bs, sometimes unfairly so. I've seen less of this bias in the STOC/FOCS community than in other communities.

There is no problem here.

Is there an area-bias? There are several questions here: (1) is the list-of-topics on the conference annoucement leaving off important parts of theory? (2) is the committee even obeying the list as is? (3) have some areas just stopped submitting?

Who cares, no, and yes. STOC/FOCS accurately reflects a large and important subcommunity of theoretical computer scientists, but it does not cover everything, nor does it really pretend to. Most important results in computational geometry, data structures, machine learning, computational biology, logic and automata theory, and structural complexity theory are published in their own conferences (SOCG, SODA, COLT, RECOMB, LICS, Complexity) instead of STOC/FOCS, because those subfields have evolved into mature communities with their own vocabulary and culture, which most theoretical computer scientists don't understand or care about.

To be specific: Computational geometers don't submit many results to STOC/FOCS because almost nobody at STOC and FOCS goes to the computational geometry talks on purpose. STOC/FOCS attendees can be tricked into going to computational geometry talks if they don't realize that's what they are—for example, Arora's TSP approximation, Spielman and Teng's smoothed analysis, Kelner's surface circle packing—but mention Voronoi diagrams or upper envelopes or surface reconstruction and people will stay away in droves. If nobody is going to come to my talk, why should I bother submitting my work?

This is natural. Communities are defined by their mutual interests. Given limited travel budgets, nobody should be surprised that people in maturing subcommunities gravitate to their own conferences, develop their own vocabularies, and attract people who have no interest in “core” theory problems at all.

What makes the situation unhealthy is the continued belief in the STOC/FOCS community that STOC and FOCS represent all of theoretical computer science, or even the best of theoretical computer science. They don't. They represent the best of what the STOC/FOCS community has to offer, as judged by the STOC/FOCS community, but nothing more.

Is there a Hot-area-bias?

Probably. Is that bad?

Is there a mafia that controls which topics gets in?

Don't be stupid. Do you really think that anyone could control the opinions of an ever-changing programming committee? Okay, in principle, the steering committee might decide who gets to be PC chair based on their loyalty to traditional theory, and then the PC chair could select the other committee members by their reputation for loyalty to Truth, Justice, and Hardness of Approximation. The program committee could then receive its marching orders from Avi Widgerson, wringing his hands and cackling his evil cackle, deep undeground in the Kurt Gödel Memorial Orthodox Theory Lair below Einstein Drive. And then the faithful Widgersonian minions would do the bidding our their One True Enlightened Master, lest they face banishment to the intellectual hinterlands of (gasp) databases. (Dunh dunh duuuuuh.) “That's a nice thesis you have there,” Wiggy would say to each new theory PhD. “It'd be a real shame if something should happen to it. A real shame.”

Right. Have you ever tried to get fifteen academics to agree on where to eat lunch? Please.

Is there a bias towards people who can sell themselves better? To people that can write well?

I certainly hope so!

Is there a bias towards making progress on old problems rather than starting work on new problems?

If anything, I think there's a bias the other way.

Is there a bias towards novel or hard techniques?

Yes and yes, one good and one bad. The bias toward novel techniques is good; the results don't matter as much as the techniques that yield them. The comunity's preference for hard techniques, however, is misplaced; simple proofs have more impact in the long run.

Is it just random?

Of course it's "just" random! It's far from uniform, or identically distributed, or even independent, but yes, it's definitely random. Is anyone seriously suggesting that it could be anything else? (See “There is No Cabal” above.)

Are there many very good papers that do not get in? It has been suggested that we go to double sessions so that more get in. If the quality of papers has been going up over time this might make sense and would not dilute quality.

Ah, yes, the apologist's argument for grade inflation—students are better now than they used to be, so they deserve higher grades. (Also, they pay more tuition, and we need those alumni donations more.) This is usually uttered just one short breath before the ancient lament on the declining literacy, numeracy, moral fortitude, and musical taste of Kids These Days™, with the hippin and the hoppin and the bippin and the boppin.

It may very well be true that today's papers are “better” than papers published at FOCS in the 1970s, but only because the field has matured, thanks to a few giants with broad shoulders. It's not like “quality” is an absolute thing. The properties that make up a good paper are decided by the community, and the community evolves over time (or stagnates). The standards that make up good papers likewise evolve.

Yes, there are a few excellent papers that don't get in. That's to be expected; committee members are human; they disagree; they make mistakes. But much more often, there's a huge gray area of pretty good papers, some of which get in and others not, depending on the personal preferences of the committee members, the topics of other papers, the phase of the moon, the brand of coffee served at the committee meeting, and whether said coffee has already run out when a given paper is discussed.

And whadya mean "go to double sessions"? FOCS has had double sessions for years.

Is 10 pages too short for submissions? This was part of Vijay's Video Suggestion. Are figures and diagrams counted for those 10 pages? If they are they shouldn't be.

Nonsense. Of course they should be! Page limits should apply to all content, and figures and diagrams (if they're worth including at all) are definitely content. And yes, 10 pages is enough. If it really takes more than 10 pages to get the main ideas across, it's not a good conference paper and it won't make a good conference talk. Put it on the ArXiv and send it straight to a journal.

I actually like Vijay's suggestion, but not because I think theory results should be judged by presentations. The only purpose of a presentation is to inspire people to read the paper. Important details should be omitted from talks. No, I like Vijay's suggestions because it would force people to think about how they present their work when they are forced to omit all the details. Would this bias the acceptance process toward people who give good talks? Of course. Isn't that what conferences are for?

Are many submissions written at the last minute and hence badly written?

Yes. Also, many papers are written badly weeks in advance. A miniscule number of papers are written well at the last minute, too. Just not yours (or mine).

Are many submissions written by the authors taking whatever they have by the deadline and shoving it into a paper?

Yes. And sometimes these are the best papers at the conference. And sometimes they're crap.

Since the conference is about all of theory, can any committee do a good job?

Bad framing. The conference isn't about all of theory. The theoretical computer science community is too big and too diverse for a single conference. If it were, the current committees would be doing a horrible job, since they don't represent all of theory. But in fact, the committees are doing exactly what they're supposed to be doing—representing the interests of the STOC/FOCS community.

Do other conferences have these problems?

Yes. At least, to the extent that these are “problems”. Yes, other theory conferences have a bias toward quality that is misinterpreted as bias toward Big Names and/or Mafia control. (When in Tel Aviv, be sure to visit the Paul Erdös Memorial Computational Geometry Mafia Bunker And Falafel Stand. Say hi to Mickey.) Yes, other theory conferences get a lot of badly written submissions. Yes, attendees at other theory conferences tend to think they're about all research in their nominal field (comptuational geometry, say) when in fact the conference covers only a small fraction of that field.

Do you actually get that much out of the talks? If not then it is still valuable to to go for the people you meet in the hallways?

Sometimes (but not often) and yes, absolutely.

April 16, 2007

It's “Coke”, dammit!

The call for papers for SODA 2008 is out. The program committee is led by computational geometer (and UIUC emeritus) Shang-Hua Teng. Other computational geometers on the committee include Mordecai Golin, Sariel Har-Peled, Jonathan Kelner, Dan Spielman, and Frances Yao. (Some of these people might be surprised (if not mortally insulted) to be identified as computational geometers, but what can you do?)

The program committee also includes two PhD students, Xi Chen and Constantinos Daskalakis, and two three postdocs, Mohammad Taghi Hajiaghayi, Nicole Immorlica, and Jonathan Kelner. They grow 'em younger every year.

The submission deadine is Friday, July 6, 2007, at 4:59pm EDT.

Update (4/17/07): Sorry, Nicole.

February 20, 2007

I wish I'd said this.

Uriel Feige answers some frequently asked questions to STOC submitters, but they apply almost verbatim to any theory conference.

Q: Who wrote the reviews?
A: Individual PC members and external reviewers. The reviews do NOT represent the collective opinion of the program committee, and need not include the reasons for accepting or rejecting the given submission.

Q: What other information was available to the program committee in making accept/reject decisions?
A: The submitted papers themselves. Other written information includes numerical scores and confidence levels (at least three per paper), and comments to the PC only. In addition, there were oral discussions during the PC meetings.

Q: Some of the reviews forwarded to me say wrong things about the paper.
A: We know and ignored these reviews.

Q: All of the reviews forwarded to me are by reviewers who did not understand the paper.
A: Try to write your paper more clearly. Alternatively, it may be the case that STOC attendees (as reflected by the composition of the STOC committee) are not the right audience for your paper.

Q: All reviewers liked my paper. How come it was not accepted?
A: Given many good papers, some difficult choices had to be made.

Q: No reviewer liked my paper. How come it was accepted?
A: Probably some committee members are asking the same question. But note again that the reviews forwarded to the authors do not reflect the full discussion. Several committee members must have liked the paper.

Q: I think that the program committee made a wrong decision in my case. How can I get more information about the reasons for this decision?
A: The only information released to the authors is the information that you already received: the accept/reject decision and those reviews of reviewers who explicitly allowed the review to be forwarded to the authors. Any additional information is confidential.

Q: What is the procedure for appealing?
A: There is no such procedure. The decisions of the program committee about rejected papers are final. The decisions about accepted papers are also final, unless subsequently a major error is discovered in the paper, in which case the authors are expected to withdraw their paper.

January 08, 2007

The 3rd Annual SODA Business Meeting Drinking Game

Continuing two years of tradition, here are the rules for this year's game.

Standard Rules: Take a drink the first time each of the following events occurs.

  • Anyone claps.
  • Anyone voices a standard complaint about the conference proper (one drink each): high registration fees, parallel sessions, overlaps beginning of classes, overlaps weekend
  • Anyone voices a standard complaint about the conference hotel (one drink each): expensive, bad meals, bad informal food (eg, coffee breaks, continental breakfasts, reception)
  • Anyone voices a standard complaint about SIAM (one drink each): full-time registration staff, unnecessary/ineffective publicity, rude registration emails, difficult web pages, poor negotiation of hotel room rates/amenities, general incompetence, greed
  • Anyone makes a standard suggestion for “improving” the conference format (one drink each): removing the 10-page limit, imposing a smaller page limit, adding shorter talks, making all talks shorter, adding another day (one drink per additional day), adding more parallel sessions (one drink per additional session), adding paper-free talks, adding a poster session
  • Anyone uses the phrase "discrete mathematics community" or equivalent
  • Anyone complains that conference papers aren't supposeed to be archival
  • Anyone makes a joke involving the phrase "train wreck"
  • David Johnson uses the passive voice (eg, "it was decided" instead of identifying the decider(s))

The Adam Buchsbaum Statistics Bonus Round:

  • Take one drink for each slide of statistics displayed by the PC chair.
  • If your name appears on the PC chair's slides for any reason, finish your beer.

The "Chocolate City" Location Bonus Round:

  • Drink once for each proposal except San Francisco and Baltimore/DC.
  • Take an extra drink if the proposed location is outside the continental U.S. (e.g., Cancun, San Juan).
  • Take an extra drink the proposed location is a university campus (e.g., UC Santa Barbara).
  • Take an extra drink if you can't tell whether the proposal is serious (e.g., Las Vegas).
  • Drink once each time David Johnson downplays a serious but non-standard proposal, because it would be difficult for SIAM to organize.
  • If someone volunteers to take over local organization duties from SIAM, buy them a beer.
  • Drink once each time either David Johnson or a SIAM representative refuses to consider such an offer because SIAM insists on organizing conferences themselves.

The Diebold Accuvote-TS Voting Bonus Round:

  • If anyone asks if we can vote for more than one option, take a drink.
  • If any vote is repeated beause of voter confusion, take a drink.
  • If any vote ends in a tie, take two drinks.
  • If anyone suggests that David Johnson is attempting to manipulate the vote, take two drinks.
  • If David Johnson makes this suggestion, finish your beer.

The "Empire Builder" Proceedings Bonus Round:

  • This bonus round begins when someone suggests electronic proceedings. Take a drink.
  • If anyone suggests eliminating paper proceedings, take a drink
  • Take a drink each time any of the following words are used: copyright, ArXiv, ISBN, web, PDF, library, tenure, ship/shipping, heavy, Amazon, profit/money/cost
  • Take one drink for each suggested electronic medium (CD-ROM, USB key, web, etc.)

The Armageddon Bonus Round:

  • If anyone seriously suggests getting rid of SIAM sponsorship, finish your beer.
  • If anyone suggests that the SODA steering committee shoudl be democratically elected, shout "¡Viva la Revolucion!" annd finish your beer.
  • If anyone suggests resurrecting short papers in any form, clap your hands and chant "We Voted No! We Voted No!" until the subject is changed, and then finish your beer.

June 05, 2006

22 years in the sausage business

Hey kids! It's time for the business meeting for the 22nd Annual ACM Symposium on Computational Geometry! Everybody got a beer? Great! Let's see what those wacky geometers are doing in Sedona this year.

Pankaj thanks the committee. Everybody claps. Then inexplicably, everybody gets up, puts on constumes and dances around the room. I finish my beer.

Alon Efrat reports on local organization: About 110 126 participants (including 32 47 students) from 16many different countries, plus Australia. Alon thanks the other local volunteers. Everybody claps. Someone from the audience thanks Alon. Everybody claps. Everybody gets up and does the Yo Gabba Gabba thing again.

Nina Amenta gives the program committee report. 142 138 submissions (apparently a few were withdrawn), of which a record 54 were accepted, thanks to a wise decision by the PC to have parallel sessions on the second day. As usual, papers about Voronoi diagrams were had a high acceptance rate, but every submission about juggling bears was rejected. Papers by an odd number of authors had a slightly worse acceptance ratio, unless exactly one of the authors was a former PC member. Much grumbling from the audience about parallel sessions, some arguing against, others in favor. Much drinking of beer from the amused but largely unconcerned audience members. Ultimately, there is a general consensus that at most one day of parallel sessions is fine, but the choice should be left to the next PC. Everybody claps, and drinks.

Joe Mitchell asks the committee to stand. Everyone claps. There is some pointless discussion about submission formats, which I can't hear over Stefan Langerman singing the conference program to the tune of "It's the End of the World as We Know It". Everyone claps. More Yo-Gabba-Gabba-ing ensues. I go for my third beer, a Bell's Wheat Love Ale. Mmmm.

Jack Snoeyink (né Snoeyink), wearing his usual snazzy jacket and carrying his usual snazzy notepad computer, juggles eight flaming swords while describing the video/multimedia presentations.

Pankaj announces a proper subset of next year's program committee, of which I am the chair. Yes, just me. A few people wonder why I'm not making the announcement myself, and for that matter, why I'm not even at the conference. A somewhat convincing explanation involving an impending birth is offered, which leads several other members of the audience to question my sanity. John Iacono stands on his chair and shouts "¡Viva la Revolucion!" Everyone else quietly takes a sip of their beer.

Oftried Cheong brings out a dozen trained elephants, who dance the watusi while Otfried describes the conference venue at Gyeongju. The word "beer" appears on the screen and everyone claps. Stefan, having reached the parallel session part of the program, enlists Erik Demaine and Bettina Speckman's help in singing counterpoint. Inexplicably, John stands on his chair and shouts "¡Viva la Revolucion!" again. One of the elephants falls of the stage, landing on one of Jack's flaming swords, and pops like a balloon. I go for my fourth beer.

Several people bid for SOCG 2008: Pankaj and Jack repeat last year's bid for Chapel Hill. David Mount repeats last year's bid for Baltimore/DC. Suresh suggests Cuba, prompting a quick (but somewhat less vertical) "¡Viva!" from John. Erik is pulled to the stage at gunpoint and handed a hastily scribbled note reads "Um, I, state your name, being of sound mind and body and acting entirely voluntarily, offer to host the next Symposium on Computational Geometry at MIT's Stata Center." Everybody claps. Pankaj confirms that yes, the first word on the note was in fact "Um". Everybody claps. Stefan, having finished his vocal rendition of the conference program, begins to sing "Fight Fiercely, Hahvahd". Jack and David, two flaming swords in each hand, angrily search the room for the source of the note. Ken Clarkson mutters under his breath, "Dear God, have you been to Cambridge?" For some reason, Piyush Kumar is still chanting "Yo Gabba Gabba!" Someone else (Tamal Dey) bids somewhere else (Columbus), but nobody can hear them. Joe calls for a vote. There is some confusion over how many options each person can vote for. Everybody drinks. MIT wins by a landslide. Washington DC wins! Everybody drinks. Someone has found 50 gallons of pink paint, which they proceed to throw over the elephants.

There being no other pressing business, everybody stands and chants in unison "But it's a dry heat!" and then forms a conga line, which winds out the door. After everyone else has left the room, John stands up on his chair as if to shout one last time, but after a few seconds, shakes his head and walks out.


Update (6/6/6): Unlike me, Suresh was really there. The actual vote for 2008 was between Washington, DC (45 votes) and Columbus, OH (28 votes). Apparently the North Carolinians have given up, and nobody was actually willing to point a gun at Erik. Yes, sir, we do like us some imported beer. Hmmm... That gives me an idea. Let's get Stefan to host SOCG 2009 in Brussels!

May 12, 2006

It's a fungus.

As a general rule, theory conferences have abbreviations that can be pronounced like standard English words, and the more edible the conference sounds, the more geometry-oriented it is: FOCS ("fox"), STOC, SODA, SOCG ("sausage"), WADS, SWAT, WAFR ("wafer"), ISAAC, COCOON, etc.

In light of this oft-repeated observation, allow me to increase the geometry-friendliness of the Indian conference "Foundations of Software Technology and Theoretical Computer Science" by offering the following edible pronunciation, courtesy of Michael Garland:

FSTTCS = "fish sticks"

Also, CCCG is pronounced "cakeage".

April 06, 2006

SODA 2007

The call for papers for SODA 2007 has been released; the submission deadline is July 5, 2006 at 4:59PM Eastern Time. Pankaj, Timothy, Sándor, Igor, and I are the geometers on the program committee.

This is a busy year for me.

April 05, 2006

We're number 13!

US News recently released its latest beauty context results rankings of computer science graduate programs, including specialized rankings in subdisciplines. UIUC came in 5th overall (tied with Cornell and behind the Big Four—CMU, MIT, Stanford, and Berkeley—who all tied for first), 8th in artificial intelligence, 8th in programming languages (tied with my undergrad alma mater Rice), 5th in systems (after the Big Four), and 13th in theory. Here is the full theory list.

  1. MIT
  2. Stanford
  3. Berkeley
  4. Cornell
  5. Princeton
  6. CMU
  7. Harvard
  8. Columbia
  9. Georgia Tech
  10. Washington
  11. Texas
  12. Chicago
  13. UIUC
  14. UCSD
  15. Yale
  16. Brown
  17. Wisconsin
  18. Caltech
  19. Duke, Penn (tie)
  20. Rutgers
  21. Maryland, Michgan (tie)

UIUC also ranked 5th in computer engineering (behind the Big Four) and 5th in engineering overall (behind MIT, Stanford, Berkeley, and Georgia Tech, and just ahead of Purdue).

In mathematics, UIUC was ranked 17th overall (tied with Minnesota and UPenn), 10th in the bizarre category of algebra/number theory/algebraic geometry, 9th in discrete math and combinations (sic), 3rd in logic, 15th in topology. UIUC was not listed in the rankings for statistics, applied math, or geometry.

What do all these numbers mean?

Almost nothing.

Sure, the US News theory ranking is a small-constant-factor approximation of reality, where "reality" is defined as "my opinion". (In particular, UIUC's #13 ranking in theory is pretty accurate.) But they should be taken with a heaping pile of salt. Some excellent students would be much happier and more successful at Harvard instead of MIT, or at Columbia instead of Cornell, or Caltech instead of Georgia Tech, despite the disparity in rankings. The most obvious factor is the compatibility of research strengths and interests. For example, UIUC is one of the best places in the country to study computational geometry, but it's not a great place for complexity theory; Chicago is exactly the reverse. Other reasons include departmental culture, course options and requirements, availability of good (effective, productive, and/or well-known) advisors, funding, success at faculty placement, cost/ease of living, off-campus social/cultural life, family issues, etc., etc. Students ain't robots, nor brains on sticks, neither. One size does not fit all.

All else being equal, MIT and Berkeley are the best places in the country to study theoretical computer science. Alas, ceteris is never paribus.

A discussion on Lance's blog hits all the major points.

February 28, 2006

Money money money

As LanceLance points out, the CISE Theoretical Foundations cluster at NSF has finally released its long-anticipated call for regular grant proposals. The submission deadline is May 25, 2006. The solicitation invokes three overlapping themes: scientific foundations for computing, scientific foundations for communication, and scientific foundations for Internet's Next Generation (SING). The first two themes were in the previous call for proposals, although the list of topics solicited under first theme has been expanded a bit. SING is part of NSF's GENI initiative, although the name conjures images of Michael Palin and Wil Wheaton belting out The Lumberjack Song on the bridge of the Enterprise-D. (Hello, my name is Jeff, and I'm a geek.)

The budget in the current solicitation is about the same as the last one. Between the expanded list of topics, the expiration of several ITR grants, and the 18-month wait since the last regular grant deadline, competition for these grants is going to be particularly fierce.

Also, as an extra special treat, simple proposals can be submitted from non-standard computers (where standard = UNIX) via grants.gov instead of Fastlane. Joy!

PureEdge recognizes that Macintosh is a popular operating system and that support for the Mac is often required by our customers. In most cases, this means offering support for the PureEdge Viewer on the MacIntosh platform.

With this in mind, PureEdge is offering support to MacIntosh users by embracing recent developments in Microsoft’s direction. With the release of Office 10 Professional, Microsoft has begun bundling Virtual PC for Mac with their office software as well as providing it as a separate product. Virtual PC is a Windows emulator that allows users to run PC software on a MacIntosh platform.

By bundling Virtual PC with it’s Office software, Microsoft has ensured broad distribution of the Virtual PC emulator, since most users rely on Microsoft Office to meet their day to day needs. Furthermore, it is clear that Microsoft will continue to support and update this product as needed.

Given this large install base and on-going development by Microsoft, PureEdge has decided to adopt the Virtual PC emulator as it’s primary means of providing support for MacIntosh computers.

What about Linux? Haven't these people heard of platform independence? You know, like HTML? And what's a "MacIntosh"? What does "embracing embracing recent developments in Microsoft’s direction" even mean? Did they really write "with it's Office software"? Who are these idiots?!

February 18, 2006

Bernard (almost) gets it right

Theoretical computer science would exist even if there were no computers. Computer science is not bound by the laws of physics; it is inspired by them but, like mathematics, it is something that is completely invented by man.

Not true! Long before Australopithecus or even Dilpodous walked the earth, ages before the primoridal slime dreamed of phtosynthesis, eons before the sun coalesced from the scattered ashes of its garishly suicidal parents, 2+2 was 4, π was transcendental, any formal system powerful enough to include arithmetic admitted true but unprovable statements, and comparison-based sorting algorithms required Ω(n log n) time. These are not mere human inventions, Bernard, but deeply humbling discoveries. These are necessary truths, in a far more fundamental sense than the so-called laws of physics.

Scott gets a little closer:

The first lesson is that computational complexity theory is really, really, really not about computers. Computers play the same role in complexity that clocks, trains, and elevators play in relativity. They're a great way to illustrate the point, they were probably essential for discovering the point, but they're not the point. The best definition of complexity theory I can think of is that it's quantitative theology: the mathematical study of hypothetical superintelligent beings such as gods.

Update (Feb 19): Bernard graciously points me to his longer essay, in which he not only hits the target smack in the center, but fires several arrows directly into their predecessors' feathery back ends. Load up your iPod with verlan-laced rap, or perhaps some vintage Wesley Willis, and read the whole thing.

An algorithm is, in essence, a work of literature.