Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity (Q2225199)
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: Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity |
scientific article |
Statements
Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity (English)
0 references
5 February 2021
0 references
multi-letter expressions
0 references
Turing machine
0 references
0.7417472004890442
0 references
0.7339637875556946
0 references
0.7260501980781555
0 references
0.725223958492279
0 references
0.7222816944122314
0 references
