Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity (Q2225199): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:49, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
