usesComputationMethod
P89
predicate
Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
All labels observed (24)
| Label | Occurrences |
|---|---|
| usesAlgorithm | 68 |
| evaluationStrategy | 37 |
| usedToCompute | 23 |
| computedBy | 19 |
| canBeComputedBy | 11 |
| computationalMethod | 11 |
| computableBy | 6 |
| computesUsing | 3 |
| computationalAspect | 2 |
| hasSamplingMethod | 2 |
| modernImplementation | 2 |
| commonAlgorithmicUse | 1 |
| commonlyComputedAs | 1 |
| digestComputation | 1 |
| hasIndexComputationMethod | 1 |
| modernComputationBasedOn | 1 |
| requiresComputation | 1 |
| usesChecksumFor | 1 |
| usesCloudProcessing | 1 |
| usesComputationMethod canonical | 1 |
| usesFirstMomentEstimate | 1 |
| usesHeuristic | 1 |
| usesIndexComputation | 1 |
| usesNaturalGradient | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: usesComputationMethod
Generated description
Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
Sample triples (197)
| Subject | Object |
|---|---|
| Serial GC | mark-sweep-compact for old generation via predicate surface "usesAlgorithm" ⓘ |
| Schmidt decomposition | von Neumann entropy of reduced state via predicate surface "usedToCompute" ⓘ |
| Schmidt decomposition | entanglement entropy via predicate surface "usedToCompute" ⓘ |
| Schmidt decomposition | Rényi entropies of entanglement via predicate surface "usedToCompute" ⓘ |
| LINPACK | Gaussian elimination via predicate surface "usesAlgorithm" ⓘ |
| LINPACK | LU factorization via predicate surface "usesAlgorithm" ⓘ |
| LINPACK | QR factorization via predicate surface "usesAlgorithm" ⓘ |
| LINPACK | Cholesky factorization via predicate surface "usesAlgorithm" ⓘ |
| Todd class | holomorphic Euler characteristic via predicate surface "usedToCompute" ⓘ |
| Todd class | indices of elliptic operators via predicate surface "usedToCompute" ⓘ |
|
Tucker decomposition in multilinear algebra
surface form:
Tucker decomposition
|
higher-order singular value decomposition via predicate surface "canBeComputedBy" ⓘ |
|
Tucker decomposition in multilinear algebra
surface form:
Tucker decomposition
|
higher-order orthogonal iteration via predicate surface "canBeComputedBy" ⓘ |
|
’t Hooft anomaly
surface form:
't Hooft anomaly
|
Feynman diagrams via predicate surface "canBeComputedBy" ⓘ |
|
’t Hooft anomaly
surface form:
't Hooft anomaly
|
index theorems via predicate surface "canBeComputedBy" ⓘ |
|
’t Hooft anomaly
surface form:
't Hooft anomaly
|
anomaly polynomial in higher dimensions via predicate surface "canBeComputedBy" ⓘ |
| Forth | stack-based evaluation via predicate surface "evaluationStrategy" ⓘ |
| ST_Within | Dimensionally Extended nine-Intersection Model via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| ST_Buffer | GEOS buffer implementation via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| Prolog | goal-directed via predicate surface "evaluationStrategy" ⓘ |
| Prolog | top-down via predicate surface "evaluationStrategy" ⓘ |
| Prolog | depth-first search via predicate surface "evaluationStrategy" ⓘ |
|
Hope programming language
surface form:
Hope
|
call-by-value via predicate surface "evaluationStrategy" ⓘ |
| PureScript | non-strict via predicate surface "evaluationStrategy" ⓘ |
| Idris | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| Idris | call-by-value via predicate surface "evaluationStrategy" ⓘ |
| Modula | call by value via predicate surface "evaluationStrategy" ⓘ |
| Arc | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| NewLISP | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| Arctic Oscillation | empirical orthogonal function analysis of sea-level pressure via predicate surface "hasIndexComputationMethod" ⓘ |
| Proca equation | propagator of a massive vector field via predicate surface "usedToCompute" ⓘ |
| Donaldson–Witten theory | Donaldson invariants via predicate surface "usedToCompute" NERFINISHED ⓘ |
| RIP | Bellman-Ford algorithm via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| Routing Information Protocol | Bellman-Ford algorithm via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| RFC 2328 | Dijkstra shortest path first algorithm via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| Zetalisp | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| Tabulae directionum | tabular numerical computation via predicate surface "computationalMethod" ⓘ |
|
Dolbeault cohomology classes
surface form:
Dolbeault cohomology class
|
harmonic (p,q)-forms on compact Kähler manifolds via predicate surface "computedBy" ⓘ |
| RFC 5302 | shortest path first via predicate surface "usesAlgorithm" ⓘ |
| RFC 5302 | Dijkstra algorithm via predicate surface "usesAlgorithm" NERFINISHED ⓘ |
| Landin’s SECD machine | environment-based evaluation via predicate surface "evaluationStrategy" ⓘ |
| MiniScheme | interpreted via predicate surface "evaluationStrategy" ⓘ |
| Io (programming language) | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| Dylan | eager evaluation via predicate surface "evaluationStrategy" ⓘ |
| Verma module | characters of irreducible highest-weight modules via predicate surface "usedToCompute" ⓘ |
|
Green's functions
surface form:
Green's function
|
propagators in quantum field theory via predicate surface "usedToCompute" ⓘ |
|
Green's functions
surface form:
Green's function
|
response functions via predicate surface "usedToCompute" ⓘ |
|
Green's functions
surface form:
Green's function
|
Green's operators via predicate surface "usedToCompute" ⓘ |
| Difference Engine No. 2 | base-10 representation via predicate surface "computesUsing" ⓘ |
| Difference Engine No. 2 | mechanical addition via predicate surface "computesUsing" ⓘ |
| Difference Engine No. 2 | mechanical carry propagation via predicate surface "computesUsing" ⓘ |