Non-perturbative graph languages, halting problem and complexity (Q2171907)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-perturbative graph languages, halting problem and complexity |
scientific article |
Statements
Non-perturbative graph languages, halting problem and complexity (English)
0 references
12 September 2022
0 references
graph languages
0 references
combinatorial Dyson-Schwinger equations
0 references
topology of graphons
0 references
halting problem
0 references
complexity of graph grammars
0 references
0 references
0 references
