Spoiler Alert

Spoiler Alert

41 个评价
Busy Beavers
   
奖励
收藏
已收藏
取消收藏
文件大小
发表于
4.459 KB
2015 年 5 月 20 日 上午 10:17
1 项改动说明 ( 查看 )

订阅以下载
Busy Beavers

描述
In computability theory, a busy beaver is a Turing machine that attains the maximum number of steps performed, or maximum number of nonblank symbols finally on the tape, among all Turing machines in a certain class.
The Turing machines in this class must meet certain design specifications and are required to eventually halt after being started with a blank tape...

https://en.wikipedia.org/wiki/Busy_beaver
2 条留言
Kersde 2016 年 1 月 28 日 下午 7:09 
is funy : D:steamhappy:
alexpm100 2015 年 12 月 14 日 下午 1:15 
Computation theory, turing machines, you are remembering me my university days.