In this brief note, we give a simple information-theoretic proof that 2-state 3-symbol universal Turing machines cannot possibly exist, unless one loosens the definition of “universal”. Disclaimer: This article was authored by Craig Alan Feinstein in his private capacity. No official support or endorsement by the U.S. Government is intended or should be inferred. In May of 2007, Wolfram Researc...

Information theory provides a powerful framework to analyse how neurons represent sensory stimuli or other behavioural variables. A recurring question regards the amount of information conveyed by a specific neuronal response. Here we show that the commonly used definition for this quantity has a serious flaw: the information accumulated during subsequent observations of neural activity fails t...

We investigate an M-ary modulation scheme and present an extension of the demodulation process. Instead of a simple symbol decision the a-posteriori symbol-probabilities for all hypotheses of transmitted symbols are calculated. Each symbol represents a group of log 2 (M) bits. This symbol probabilities are mapped for each bit individually into a-posteriori probabilities of the bits in the maxim...

Secure communication is a critical and challenging issue in wireless networks. To achieve the information theoretic secrecy the leading approach is artificial noisy symbol. The basic idea in this paper is enhancing the security in wireless communication. Multiple Inter-symbol Obfuscation(MIO) method will be deployed in the physical layer. MIO is a method for transferring the data and it provide...

We present the results of two online surveys asking participants to indicate what type of air traffic information might be conveyed by a number of symbols and symbol features (color, fill, text, and shape). The results of this initial study suggest that the well-developed concepts of ownership, altitude, and trajectory are readily associated with certain symbol features, while the relatively no...

We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the symbols(such as Huffman Codes [1]) for zero memory sources where it tends to the theorical limit of compression limited by the entropy. These metrics can be used as a fitness measure of the individuals in the Vasconcelos...

In this paper, we analyze the semiblind mutual information (MI) between the input and output of a MIMO channel. To that end we consider the popular block fading model. We assume that some training/pilot symbols get inserted at the beginning of each burst. We show that the average MI over a transmission burst can be decomposed into symbol position dependent contributions. The MI component at a c...

The efficient provision of integrated product-service bundles requires the cooperating partners’ information systems (IS) to be able to exchange production and customer master data. We reply to this problem by presenting a service-oriented architecture (SOA) based approach for connecting partners within product-service systems (PSS). The research question addressed in this paper is: Which are t...