| http://www.w3.org/ns/prov#value | - Hexstream 2060 days ago Turing completeness is actually 1. easy to achieve (even accidentally) and 2. undesirable in many circumstances (it makes code hard to analyse and process by machines and the semantics, what you really meant, get lost in the noise).There is a reason there is no way to express loops and varibles in HTML, for example.
|
