A busy-beaver-like function in complexity theory (Q6623856)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A busy-beaver-like function in complexity theory |
scientific article; zbMATH DE number 7931497
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A busy-beaver-like function in complexity theory |
scientific article; zbMATH DE number 7931497 |
Statements
A busy-beaver-like function in complexity theory (English)
0 references
24 October 2024
0 references
non-computable function
0 references
computability
0 references
\(P = NP\) problem
0 references
busy beaver functions
0 references