From Edward A. Hirsch to Alexander, Oleg, Sergey, Yura
date: 15 May 2007 14:22
subject: 25 Kbucks for 2 states
Is it possible to (dis)prove universality by automated case enumeration?..
----- Forwarded message from <...> -----
> From: <...>
> To: <...>
> Subject: [CiE] The 2,3 Turing Machine Research Prize
>
> ________________________________________________________________
> Call for Participation
>
> THE WOLFRAM 2,3 TURING MACHINE RESEARCH PRIZE
> May 14th, 2007
>
>
http://www.wolframprize.org> ________________________________________________________________
>
> We are pleased to announce the Wolfram 2,3 Turing Machine Research
> Prize in celebration of the 5th anniversary of Stephen Wolfram's A New
> Kind of Science (
http://www.wolframscience.com/nksonline).
>
> The research prize is sponsored by Wolfram Research and Stephen
> Wolfram and consists of $25,000 US to the first individual or group to
> successfully determine whether or not a particular 2-state 3-color
> Turing machine is universal, and submit a full proof of such claim to
> the satisfaction of the Prize Committee.
> <...>
aengus_spb,
smartnik,
yury_lifshits, ну и кто мы с вами после
этого?
P.S. Как знал я, что этот юзерпик мне скоро в жж понадобится...
Update: А вот и
пост в блоге Лэнса Фортноу (который ведется сейчас кем-то другим, насколько я помню) с некоторым количеством ссылок по теме, включая ссылку на фотографию решившего студента.