Re:HTML + CSS3 is Turing complete
by sid0 on Tuesday March 08, 2011 @02:04PM
(#2302133)
"Turing" is not a complexity class, so "Turing Complete" is nonsense.
Good thing that complexity theory isn't the only part of CS that uses the notion of completeness. Turing (aka recursively enumerable functions) is a computability class, and it makes sense to talk about models of computation complete for that class.
Good thing that complexity theory isn't the only part of CS that uses the notion of completeness. Turing (aka recursively enumerable functions) is a computability class, and it makes sense to talk about models of computation complete for that class.