The All-Thing
   


All carrot and no stick, since ought-three.

賦得暮雨送李胄 (韋應物)

楚江微雨裡,建業暮鐘時。
漠漠帆來重,冥冥鳥去遲。
海門深不見,浦樹遠含滋。
相送情無限,沾襟比散絲。

Contact:
| web page

Other views:
RSS 0.92
RSS 1.0 (broken)

Past posts:

June
Sun Mon Tue Wed Thu Fri Sat
16
         

Recent comments:

Recent search referers:
"bittorrent pr0n"
dell x300 review
?云翻墨未遮山,?雨跳珠乱八船
Զƫ
޽ý
dell x300 linux
wordsworth bittorrent
half life 2 bittorrent (x2)
Dell x300 linux
"latitude x300" linux CD
linux dell x300
chinese bittorrent
Latitude X300 linux (x2)
we are seven*wordsworth
story of romeo & juliet
bittorrent pr0n links
饮酒 结 在人境
地猶氏邑
pictures of mechanism in wrist watches
X300 linux
Test Dell Latitude X300
下馬飲君酒
心远地自偏
turing
dell x300
craigslist.uk
"named entity tagger"
a girl thing bittorrent
x300 linux (x2)
"bittorrent xbox"
gateway 200x review
Terence this is stupid stuff A.E. Housman meaning
bittorrent debbie does dallas 80's
pr0n bittorrent
XP Smoker
bittorrent pr0n (x5)
reviews dell x300
"lone wolf and cub" "bittorrent" "movie"
Dell X300
chubby guy
BitTorrent english
BitTorrent pr0n
Turing

Exits:
dumbEngineer



Creative Commons License
This work is licensed under a Creative Commons License.

       
Mon, 16 Jun 2003

Turing machines

So BoingBoing had a pointer to this article by some dude about Turing machines and Turing computability. This guy allegedly has a PhD in CS from Duke. Wtf.

I posted a critical comment (comment #2) which I'm going to expound upon briefly here.

Turing machines are a model of computation. What makes them universal is that, for any set of separate Turing machines that do different things, including the infinite set of all possible Turing machines, one can find/construct a single Turing machine that does all of those tasks. In other words, adding one Turing machine to another does not remove you from the world of Turing machines—you simply end up with a third Turing machine.

Now what makes Turing machines a powerful idea is the Church-Turing hypothesis, which essentially states that anything that we as humans would call computation can be performed by a Turing machine. The C-T hypothesis, like many scientific theories, can never be logically proved, but it has not been disproved, and people believe it.

Computatability theorists have studied more powerful models of computation than Turing machines, in particular ones where you assume the presence of a magical oracle which answers correctly any question you pose it, but these models do not correspond to anything in the real world. Saying that because people have studied these models, Turing machines are somehow irrelevant or insufficient or outdated, is simply incorrect.

Anyways, I just find it a bit bizarre that this guy attacks Turing machines. It's a little difficult to really understand his arguments because he confuses a lot of terminology and ideas.

Posted at 09:26 | /computing | (leave a comment) | permalink


   

For a light heart lives long. -- Shakespeare, "Love's Labour's Lost"