--8<---------------cut here---------------start------------->8---
Removed rec.sport.pro-wrestling. (Can't see any sense in that.)
--8<---------------cut here---------------end--------------->8---
Blue-Maned_Hawk <bluema...@invalid.invalid> writes:
> A trinary computer would still be turingcomplete
Technically, we could have a binary or trinary computer that's not
Turing complete. Turing completeness is a function of the instruction
set of the computer. Even more technically, it also requires an
infinite memory. (But when someone says---it's Turing complete---, it's
usually just meant that it's able to loop.)