turingComplete
P26986
predicate
Indicates that a system or language is capable of performing any computation that a universal Turing machine can, given enough time and memory.
Sample triples (1)
| Subject | Object |
|---|---|
| PostScript | true ⓘ |