On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to the computability of the bandwidth of computable bandlimited signals. To this end we employ the concept of Turing computability, which exactly describes …