Knext

Query Results: Computation.n (page 136)

6,153 results in the active KB.

A theory of computation can be a force.
Logical form
Learned from
3 sentences.
A computation may assume that something-is-the-case.
Logical form
Learned from
3 sentences.
A formula may undergo a computation.
Logical form
Learned from
3 sentences.
Computations can be powerful.
Logical form
Learned from
3 sentences.
Computations can be easy.
Logical form
Learned from
3 sentences.
A message can be constituted-of-or-filled-with computation.
Logical form
Learned from
3 sentences.
A specification may be based on a message of computation.
Logical form
Learned from
3 sentences.
A (delay computation) can be negative.
Logical form
Learned from
3 sentences.
Steps may be required for a computation.
Logical form
Learned from
3 sentences.
Checking can be with symbolic computation.
Logical form
Learned from
3 sentences.
A computation can be syntactic.
Logical form
Learned from
3 sentences.
A basis may pertain-to computations.
Logical form
Learned from
3 sentences.
Results can be from a computation.
Logical form
Learned from
3 sentences.
Gains may undergo a computation.
Logical form
Learned from
3 sentences.
Material may be related to evolutionary computation.
Logical form
Learned from
3 sentences.

Search

Results returned on 2026-07-25.