Re: Prize Announced for Determining the Boundaries of Turing Machine Computation

On May 16, 2:25 pm, Wolfram Research <newsd...@xxxxxxxxxxx> wrote:
Wolfram Research and Stephen Wolfram are pleased to announce the
Wolfram 2,3 Turing Machine Research Prize in celebration of the
fifth anniversary of Stephen Wolfram's "A New Kind of Science."

A $25,000 prize is offered to the first person or group to prove
(or disprove) that a particular Turing machine can act as a
universal computer. The purpose of the prize is to encourage
research that will help fill in foundational questions associated
with the structure of the computational universe. The invitation
to participate, and eligibility to win the prize, is extended to
everyone.

The prize is being adjudicated by a distinguished committee
consisting of Lenore Blum, Greg Chaitin, Martin Davis, Ron
Graham, Yuri Matiyasevich, Marvin Minsky, Dana Scott, and Stephen
Wolfram.

Further details are available at:http://www.wolframprize.org

First question in that direction: Is the Turing Machine that goes to
the same state # 1 and moves to the right 1 for all characters
scanned a universal TM and why or why not?

What has been done on this problem so far?

(As far as the prize goes, a look at the judges - Chaitin,
Minsky, . . . - yikes!)

C-B

.

Relevant Pages