Spoiler Alert

Spoiler Alert

41 betyg
Busy Beavers
   
Utmärkelse
Favorit
Favoritmarkerad
Avfavoritmarkerad
Filstorlek
Lades upp
4.459 KB
20 maj, 2015 @ 10:17
1 ändringsnotis ( visa )

Abonnera för att ladda ner
Busy Beavers

Beskrivning
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 kommentarer
Kersde 28 jan, 2016 @ 19:09 
is funy : D:steamhappy:
alexpm100 14 dec, 2015 @ 13:15 
Computation theory, turing machines, you are remembering me my university days.