"This is a nice example of a tic unique to legislators and particularly common with Ben Nelson: the constituent voice. Some politicians talk in the first person ("I oppose raising taxes on the rich"). Some talk in the third-person ("Bob Dole opposes raising taxes on the rich"). And then some talk in the constituent person ("Voters oppose raising taxes on the rich"). The problem with the constituent person, however, is that it's falsifiable. And in this case, it's false."

"This paper seeks to explode the myth that Turing Machines (TM) are the universal model for all computation."

Now would somebody please undermine the computational complexity greed people have about algorithms? I find it deeply embarrassing to be told by somebody who "knows too much" that they will never even try an algorithm that is worse than polynomial, under any circumstances or for any problem. Like the idiots who have been taught some Gaussian statistics and say they would never gamble in a Casino because they KNOW they would ALWAYS lose.