4 ms·
In predicate calculus specification languages, you can write X such that P(x) where P is a test predicate. Doesn't mean you have any idea how to generate
by Animats 5y ago
In predicate calculus specification languages, you can write
X such that P(x)
where P is a test predicate. Doesn't mean you have any idea how to generate X. A long time ago, when this idea was going around for the first time, I was using a formal specification language called SPECIAL. I wrote the statement of Fermat's Last Theorem in Special to demonstrate that merely being able to formally specify something doesn't necessarily lead to a solution.
- mannykannot 5y agoIndeed, but as far as I can tell, the particular specification language here is at a much lower level of abstraction, one where we have only slightly-abstracted pointers, and consequently, I suspect, a specification using this particular logic will have no choice but to say how to generate X (or perhaps I should say that the intention is that one should say how to generate X, even if, formally, one can avoid doing so.)