How to play Google's Turing machine?

1

Comments

<- 左箭头:数据向右移动一位(光标向左移动一位) logic shift right 1 bit, cursor shift left 1 bit
-> 右箭头:数据向左移动一位(光标向右移动一位) logic shift left 1 bit, cursor shift right 1 bit
1:将当前光标所在位置1 set the cursor bit as 1
0:将当前光标所在位置1 set the cursor bit as 0

a number w/ a box and up/down arrow 数字,带有框和上下方向的箭头: 如果光标所在位是框内的数字, 转移到箭头向上/下的语句, 否则继续前进. 如果框内没有数字, 表明转移条件是这个位是空白的.If the cursor bit is the number in the box, jump into arrow up/down, else go ahead. The blank box means this the branch condition is if this bit is blank.

a loop arrow w/ some bits inside: 一个环箭头, 里面有一些点: 回到前面. 几个点表示回到几个指令之前. Loop back, the amount of the small bit inside means how many instructions should loop back.

e.g(RED for cursor) The first puzzle in google doodle.
00010 -> 01011

So let's do this.

_LSR 00010 -> 00010
SET1 00010 -> 01010 //We must change the operator "0" into "1".
_LSL 01010 -> 01010
_LSL 01010 -> 01010
_LSL 01010 -> 01010
SET1 01010 -> 01011 //We must change the operator "0" into "1".

Got it! Like basic assembly language?
Have fun w/ this amazing machine. Hail to Alan Mathison Turing, an mathematician, logician, cryptanalyst and computer scientist.

One Response to “How to play Google's Turing machine?”

  1. 婉秋 Says:
    Jun 23rd, 2012 Firefox 13.0.1 Windows 7 19:07 Reply

    我琢磨了好久~~不是到是什么算法还用最原始的方式一个个试……哈哈
    话说我访问这儿会被重置

来了你就吐槽我吧!






Note: Commenter is allowed to use '@User+blank' to automatically notify your reply to other commenter. e.g, if ABC is one of commenter of this post, then write '@ABC '(exclude ') will automatically send your comment to ABC. Using '@all ' to notify all previous commenters. Be sure that the value of User should exactly match with commenter's name (case sensitive).