Computability of the Zero-Error Capacity of Noisy Channels
Abstract: Zero-error capacity plays an important role in a whole range of operational tasks, in addition to the fact that it is necessary for practical applications. Due to the importance of zero-error capacity, it is necessary to investigate its algorithmic computability, as there has been no known closed formula for the zero-error capacity until now. We show that the zero-error capacity of noisy channels is not Banach-Mazur computable and therefore not Borel-Turing computable. We also investigate the relationship between the zero-error capacity of discrete memoryless channels, the Shannon capacity of graphs, and Ahlswede's characterization of the zero-error-capacity of noisy channels with respect to the maximum error capacity of 0-1-arbitrarily varying channels. We will show that important questions regarding semi-decidability are equivalent for all three capacities. So far, the Borel-Turing computability of the Shannon capacity of graphs is completely open. This is why the coupling with semi-decidability is interesting.
- R. Ahlswede, A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon’s zero-error capacity, Ann. Math. Stat., vol. 41, no. 3, 1027-1033, 1970.
- R. Ahlswede, On concepts of performance parameters for channels, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, Springer Verlag, 639-663, 2006.
- R. Ahlswede, Towards a General Theory of Information Transfer, Shannon Lecture at ISIT in Seattle 13th July 2006, IEEE Inform. Theory Society Newsletter, vol. 57, no. 3, 6-28, 2007.
- N. Alon, The Shannon capacity of a union, Combinatorica, 18(3):301–310, 1998.
- K. Gödel, Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Monatshefte für Mathematik, vol. 37, no. 1, 349–360, 1930.
- K. Gödel, On undecidable propositions of formal mathematical systems. Notes by Stephen C. Kleene and Barkely Rosser on Lectures at the Institute for Advanced Study, Princeton, NJ, 1934.
- W. Haemers, On some problems of Lovász concerning the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25(2):231–232, 1979.
- S.C. Kleene, Introduction to Metamathematics, Van Nostrand, New York: Wolters-Noordhoffv, 1952.
- M. Minsky, Recursive unsolvability of Post’s problem of ’tag’ and other topics in theory of Turing machines. Ann. Math., vol. 74, no. 3, 437–455, 1961.
- J. Körner, A. Orlitsky, Zero-error information theory, IEEE Trans. Inform. Theory, 44(6):2207–2229, 1998.
- L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25(1):1–7, 1979.
- Y.I. Manin, A Course in Mathematical Logic for Mathematicians. Springer, New York, 2010.
- M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics. Cambridge University Press, Cambridge, 2017.
- C.E. Shannon, The zero-error capacity of a noisy channel, Institute of Radio Engineers, Transactions on Information Theory, IT-2(September):8–19, 1956.
- E. Specker, Nicht konstruktiv beweisbare Sätze der Analysis, Journal of Symbolic Logic, vol. 14, no. 3, 145–158, Sep. 1949.
- A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., vol.2, no. 42, 230–265, 1936.
- A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem. A correction, Proc. Lon-don Math. Soc., vol. 2, no. 43, 544–546, 1937.
- K. Weihrauch, Computable Analysis - An Introduction, Springer-Verlag, Berlin Heidelberg, 2000.
- J. Zuiddam, Asymptotic spectra, algebraic complexity and moment polytopes, PhD thesis, University of Amsterdam, 2018.
- J. Zuiddam, The asymptotic spectrum of graphs and the Shannon capacity, J. Combinatorica 39, 1173–1184, 2019.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.