tly they can do it. Efficiency relates to comp=tational complexity classes. The simplest universal computers known are some cellular automata, with Min=ky and Wolfram arguing about who found the shortest one. Boolean algebra i= Turing complete, too, as is the NAND gate, the lambda calculus, and almos=

tly they can do it. Efficiency relates to comp=tational complexity classes. The simplest universal computers known are some cellular automata, with Min=ky and Wolfram arguing about who found the shortest one. Boolean algebra i= Turing complete, too, as is the NAND gate, the lambda calculus, and almos=