Parsimonious computational completeness (Q832917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7498712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parsimonious computational completeness |
scientific article; zbMATH DE number 7498712 |
Statements
Parsimonious computational completeness (English)
0 references
25 March 2022
0 references
normal forms
0 references
computational completeness
0 references
descriptional complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
