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 |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2008.13270 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:34, 19 April 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
