Login
From:
wiki.bbchallenge.org
(Uncensored)
subscribe
Instruction-Limited Busy Beaver - BusyBeaverWiki
https://wiki.bbchallenge.org/wiki/Instruction-Limited_Busy_Beaver
links
backlinks
An n-instruction Turing machine is a Turing machine having an arbitrary number of states and symbols, but having only n defined transitions/instructions in its transition table (all others are undefined).
Roast topics
Find topics
Roast it!
Roast topics
Find topics
Find it!
Roast topics
Find topics
Find it!
