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.
All labels observed (3)
| Label | Occurrences |
|---|---|
| isTuringComplete | 1 |
| turingComplete canonical | 1 |
| turingCompleteness | 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: turingComplete
Generated description
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 (3)
| Subject | Object |
|---|---|
| PostScript | true ⓘ |
| M language | true via predicate surface "isTuringComplete" ⓘ |
| Bitcoin Script | not Turing-complete via predicate surface "turingCompleteness" ⓘ |