So far, development of web-based resources that represent information through shared computable languages has focused on 'primary products' of research, such as datasets and literature.
The latter is of particular significance since anything that can be represented in terms of λ-calculus can be encoded in the computer language LISP, and is therefore by implication Turing-computable.
In this paper, we consider each of the nine principles of BDI logics as defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a computable logic language inspired by the BDI architecture for cognitive agents.
Even today, every program written in an existing implemented programming language is Turing computable and conversely, all general-purpose programming languages are Turing complete, i.e., they contain all the control constructs necessary to simulate a universal Turing machine.
We show how our approach of dynamic reconfigurations of parsed syntax trees using a number of production rules is used to formalize and transform natural language constructs into computable constraints that are applied to concrete building information models.
However, Zsyntax is first and foremost a logic, that is a well-formulated (in a technical sense) language which is computable.
We developed a tool [ 29], N2BB, which implements an automatic translation of models described in the biologically-intuitive Narrative Language into executable computable models formulated in BlenX [ 11], a programming language inspired on the Beta-binders process calculus [ 4].
The main strength of BEL is that it is easily human-readable and machine-computable, making it an ideal language to capture literature evidences from manual curation as well as text mining pipelines.
Assuming the Church-Turing thesis, universal Turing machines can compute any function computable by algorithm.
In addition, words are not formally computable, i.e., a machine will not necessarily be able to determine whether two distinct natural language strings represent the same entity or attribute.
