Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_logic_concept
|
| gptkbp:describes |
properties of complexity measures
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:firstAxiom |
complexity function is total recursive
|
| gptkbp:introducedIn |
1967
|
| gptkbp:namedAfter |
gptkb:Manuel_Blum
|
| gptkbp:numberOfAxioms |
2
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:Kolmogorov_complexity
computational complexity |
| gptkbp:secondAxiom |
complexity function is effectively enumerable
|
| gptkbp:usedFor |
defining complexity measures for Turing machines
|
| gptkbp:bfsParent |
gptkb:Manuel_Blum
|
| gptkbp:bfsLayer |
4
|
| https://www.w3.org/2000/01/rdf-schema#label |
Blum axioms
|