I just want for someone to prove the Church-Turing conjecture for the set of all finite programs<->calclus. I specified finite as PM breaks down when dealing with an infinite number of elements into a set and Godel do not applies here as I do not search the truth value of a proposition, only a mapping D->P as I transform the parsing and interpretation of a finite description D to an hypothetical lambda calculus problem P. As long as all descriptions are finite and that the Church-Turing conjecture holds true, my conjecture is safe. Sure, there is no usefulness in that transformation, it's only a device to show that at least one mathematical description must exist.
I wish I could address your remark on Tractatus Logico-Philosophicus but I lack knowledge of that book to address your concerns.
And lastly, the project in Principia Mathematica is, in my humble opinion, not failed but it is incomplete and limited to finite sets.

I would argue that every non-mathematical correct description of nature is transformable into math by involving the Church-Turing lambda-reductibility thesis. Axiom 1: A description is made using a language. Axiom 2: A description is not infinitely long. A correct non-mathematical description of a natural process using a language. Since that natural process is express as with a language, it is possible to build an interpreter for that a finite set of that language. Since an interpreter is realized-by and realized computations, according to the Church-Turing thesis an equivalent lambda calculus problem exists. Therefore, if the Church-Turing lambda-reductibility thesis hold true, every language based description must have at least one equivalent mathematical problems. I concede that this description is probably useless and really hard to build but it exist nonetheless.

have a look at that : http://www.rfid-radar.com/howworks.html

I ordered one from Newark after javaone and I am currently running XBMC on it. I just looked at the site they are out of stock until nov 26, then they will have 1321 more

Because you want the key to be destroyed in case of eavesdrop. Suppose you swap a 64Gb one time pad with me, what assurance do you have that I did not copy the file to Alice ?

no, the safe way would be to synchronized something like a good atomic clock in person, transmit periodically the the drift and sometime a key or a ping using the low energy hidden in plain sight technique

the sound subsystem fragmentation is what keeping Linux from being an obvious target for game publisher.

It does, way too much for my own taste. That why it should be banned: it does make it too safe to kill...

every game encryption key is xor with an game specific OTP, they need that gig to hold the pad :P

move to a state that legalized cannabis and sell it with your rentals, you will get an incredible increase in cash flow

Oh, and I forgot to tell you that is was all a big prank.

You are way wrong, read on the dadaist, the modern art movement was seeded by theirs manifesto. No need to involve racial conspiracy.

Randomness, big numbers and low probabilities transform mystical events into rare events. No need to involved supranatural source for life's gifts

Well here we give in house MS Office training to those who request it, but we are a University and we give that training as a part of the business administration cursus, so that training only cost us the trainee time.

Some laws are worth less than friend, even shady friends...
ex: Let's assume that a friend confess to me that he raped a girl last weekend, I would denounce him without a hint of hesitation. Now imagine that he confessed that last weekend he was snorting cocaine on some prostitutes ass; I would not call the cops, would you ?