October 2002
Sun Mon Tue Wed Thu Fri Sat
    1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30 31    
Sep   Nov


pages I visit regularly


Click here to send an email to the editor of this weblog.  Write to me!


more posts
Reclaiming My Life: A Declaration of Intent
The Revenge of the Dead Cow Cult
Updating Neighbors
The Ultimate Pun
The Obligatory Naked Mole Rat Advisory
Beauty is in the Eye of the Beholder
And oh, by the way...
World Dominion and Other Pastimes
Two unsettling developments.
Why You CAN Teach an Old Dog New Tricks
No Birdbrains Here

Wednesday, October 23, 2002

Instant Humility
If ever I need to be reminded of at least one of my many inadequacies, I need only visit My Computational Complexity Weblog. Sample quote:

The interesting open problem of the day comes from Pierre McKenzie. Consider a circuit that works on sets of nonnegative integers. Inputs are the sets {0} and {1}. The gates consist of union, intersection, complement, addition and multiplication. Addition of two sets A and B is the set consisting of x+y for x in A and y in B. Multiplication is similar.

Given such a circuit with specified input sets and an integer w, is it decidable whether w is in the set generated by the output gate?

A decision algorithm for this problem yields a way to settle Goldbach´s conjecture that every even number greater than 2 is the sum of two primes. I´ll leave this implication as an excercise.

On the site I can tell what's a verb and what's a noun (mostly), and I can understand some of the sentences... but oh. my. god. the things I don't know and will simply never be able to understand.

Here endeth the lesson.
12:42:21 AM    please comment []



© Copyright 2002 Pascale Soleil.
Last updated: 11/11/02; 4:28:19 PM.
Comments by: YACCS
Click to see the XML version of this web page.