A) Bioinformatics B) Seismic exploration C) Gambling D) Cryptographic use
A) Random seeds external to the software B) High Shannon entropy C) Analog processing methods D) Integrated neural clusters
A) Through Shannon entropy B) Via digital noise C) By using semiotic signs D) Via extractors
A) Free energy B) Dynamic core hypothesis C) Min-entropy D) Effective information
A) Rényi entropy B) Thermal entropy C) Algorithmic entropy D) Conditional entropy
A) In evaluating randomness in cryptographic systems B) In semiotic code control C) In seismic oil exploration D) In minimizing free energy
A) Yes B) No C) Only for pseudorandom numbers D) Only in cryptographic systems
A) Bioinformatics B) Black hole analysis C) Seismic oil exploration D) Search for extraterrestrial intelligence
A) Generate secure pseudorandom numbers B) Strip off and separate unwanted noise from the desired seismic signal C) Minimize free energy in the brain D) Decode dominant social messages
A) Free energy principles B) Extractors and Rényi entropy C) Cryptographically secure pseudorandom number generators D) Information theory and digital signal processing
A) Umberto Eco and Ferruccio Rossi-Landi B) Karl J. Friston and Andrey Kolmogorov C) Gerald Edelman and Giulio Tononi D) Doede Nauta and Winfried Nöth
A) The measurement of sufficient randomness in extractors B) The separation of unwanted noise from seismic signals C) The minimization of free energy in a self-organized system D) The study of the internal processes of coding, filtering, and information processing
A) Umberto Eco and Ferruccio Rossi-Landi B) Gerald Edelman and Karl J. Friston C) Doede Nauta and Winfried Nöth D) C.E. Shannon and R.V.L. Hartley
A) By applying the free energy principle B) By utilizing cryptographically secure pseudorandom seeds C) By using signs that exhibit a high degree of redundancy D) Through digital signal processing of seismic signals
A) To analyze the integrated process organization of neural information B) To extract random numbers for cryptography C) To study black holes and bioinformatics D) To explore seismic oil deposits
A) The issue of seismic noise filtering B) The binding problem in cognitive neuroscience C) The problem of algorithmic complexity D) The paradox of extraterrestrial intelligence
A) R.V.L. Hartley and C.E. Shannon B) Gerald Edelman and Giulio Tononi C) Umberto Eco and Ferruccio Rossi-Landi D) Doede Nauta and Winfried Nöth
A) Effective information B) Seismic signal processing C) Shannon entropy D) Min-entropy
A) Analog methods of data transmission B) A reentrant process organization C) External cryptographic random seeds D) A high degree of redundancy in signs
A) The coding and filtering processes studied in semiotics B) The generation of pseudorandom numbers using extractors C) The synchronization of neurophysiological activity between groups of neuronal populations D) The filtering of unwanted noise from desired seismic signals
A) Gerald Edelman B) Karl J. Friston C) Charles Sanders Peirce D) Giulio Tononi
A) A dominant social class B) A cryptographic random number generator C) A self-organized system D) An analog seismic receiver
A) The integrated information theory B) The semiotic information theory C) The Bayesian brain hypothesis D) The dynamic core hypothesis
A) Astrology B) Search for extraterrestrial intelligence C) Alchemy D) Phrenology
A) Black holes B) Neural clusters C) Tectonic plates D) Seismic waves
A) Biomechanics B) Biochemistry C) Bioinformatics D) Biophysics
A) Cipher creation B) Chess C) Crosswords D) Gambling
A) Umberto Eco B) Doede Nauta C) Gerald Edelman D) R.V.L. Hartley
A) Ferruccio Rossi-Landi B) C.E. Shannon C) Winfried Nöth D) Giulio Tononi
A) Andrey Kolmogorov B) Charles Sanders Peirce C) Winfried Nöth D) Karl J. Friston
A) Dynamic core hypothesis B) Free energy principle C) History of information theory D) Integrated information theory
A) A single organ B) A brute force attack C) A network D) A block cipher
A) Information theory units B) Distinct physiological states C) Symmetric keys D) Unicity distances
A) How encryption keys are generated B) Why it ceases permanently C) How it occurs D) Why brute force attacks succeed
A) Cardio-respiratory interactions B) Cryptographic interactions C) Enigma machine interactions D) One-time pad interactions
A) Extreme environments B) Cryogenic laboratory environments C) Simulated virtual environments D) Underground bunker environments
A) The shannon B) The ban C) The bit D) The byte
A) The Venona project B) The Unicity project C) The Ultra project D) The Enigma project
A) Symmetric key code B) Lorenz cipher code C) Enigma machine code D) One-time pad code
A) It is much more difficult than it might first appear B) It is completely impossible under any circumstances C) It requires no computational effort D) It is extremely easy using symmetric keys
A) A network physiology attack B) An information-theoretic attack C) A conditional mutual attack D) A brute force attack
A) Secret key algorithms B) Unicity distance algorithms C) One-time pads D) Asymmetric algorithms
A) Transfer entropy B) Bans C) One-time pads D) Block ciphers
A) Brute force B) Transfer entropy C) Care D) Block ciphers
A) The Ultra project B) The Network Physiology project C) The Venona project D) The Enigma project
A) Rate-distortion theory B) Lossless data compression C) Channel coding D) Lossy data compression
A) Source-channel separation theorems B) Pragmatic information C) Rate-distortion theory D) Channel resolvability
A) Bytes B) Distortion functions C) Entropy D) Bits
A) The multiple-access channel B) The wiretap channel C) The broadcast channel D) The relay channel
A) The multiple-access channel B) The wiretap channel C) The broadcast channel D) The relay channel
A) The broadcast channel B) The multiple-access channel C) The wiretap channel D) The relay channel
A) Conditional entropy B) Kullback-Leibler divergence C) Cross-entropy D) Mutual information
A) Vector space B) Product space C) Euclidean space D) Metric space
A) -log2(pi) B) 1 / pi C) -ln(pi) D) log2(pi)
A) The geometric mean B) The maximum value C) The weighted average D) The median
A) 1000 shannons B) 2000 bits C) No information D) 1 shannon
A) 1948 B) 1939 C) 1952 D) 1960
A) 1920s B) 1930s C) 1940s D) 1950s
A) Molecular biology B) Quantum computing C) Telecommunication D) Artificial intelligence
A) 0.5 bits B) Zero C) 1 bit D) 2 bits
A) Voyager missions B) ZIP files C) Compact discs D) DSL
A) ZIP files B) Artificial intelligence C) Mobile phones D) DSL
A) Apollo missions B) Voyager missions C) Curiosity rover D) Hubble telescope
A) Radio B) Compact disc C) Steam engine D) Television
A) Mobile phones B) Automobiles C) Airplanes D) Electric guitars
A) The postal service B) The telegraph network C) The Internet D) The printing press
A) Distributed computing B) Optical computing C) Quantum computing D) Cloud computing
A) Sculpture casting B) Art creation C) Architectural drafting D) Oil painting restoration
A) Musical instrument design B) Music C) Vocal cord anatomy D) Acoustic room resonance
A) Ethics B) Aesthetics C) Epistemology D) Metaphysics
A) Vannevar Bush B) Ralph Hartley C) James Gleick D) Harry Nyquist
A) 1939 B) 1940 C) 1928 D) 1948
A) Alan Turing B) Vannevar Bush C) Ludwig Boltzmann D) James Gleick
A) Claude Shannon B) Alan Turing C) Ralph Hartley D) Harry Nyquist
A) PV = nRT B) E = mc2 C) H = log Sn D) W = K log m
A) The byte B) The bit C) The decimal digit D) The baud
A) Harry Nyquist B) Ralph Hartley C) Alan Turing D) Claude Shannon
A) James Gleick B) Harry Nyquist C) Vannevar Bush D) Rolf Landauer
A) Decimal logarithm B) Common logarithm C) Natural logarithm D) Binary logarithm
A) Common logarithm B) Binary logarithm C) Base-two logarithm D) Natural logarithm
A) Natural logarithm B) Binary logarithm C) Common logarithm D) Base-e logarithm
A) The most unpredictable state B) The most predictable state C) A deterministic sequence D) The lowest possible information content
A) Base-10 B) Base-256 C) Base-2 D) Base-e
A) A Bernoulli trial B) A Markov trial C) A logarithmic trial D) An equiprobable trial
A) Joint entropy B) Marginal entropy C) Mutual information D) Equivocation
A) Kullback-Leibler divergence B) Log-likelihood ratio C) Pointwise mutual information D) Transinformation
A) Communication B) Macroeconomics C) Thermodynamics D) Quantum mechanics
A) Euclidean distance B) Kullback-Leibler divergence C) Jensen-Shannon divergence D) Mahalanobis distance
A) Mann-Whitney U test B) Log-likelihood ratio test C) Student's t-test D) Shapiro-Wilk test
A) Semi-quasimetric B) Inner product C) Linear transformation D) Euclidean metric
A) Both B) Bob C) Alice D) Neither
A) Bob B) Alice C) Both will be equally surprised D) It is impossible to determine
A) An infinite continuous set B) A finite geometric set C) An empty set D) A discrete set
A) Only in quantum states B) Yes C) No D) Only in macroscopic mechanics
A) {X1, Y1, ..., X_n, Y_n} B) {Y1, Y2, ..., Y_n} C) {X0, X1, ..., X_{n-1}} D) {X1, X2, ..., X_n}
A) The same result B) An undefined value C) Completely different results D) A result of zero
A) An inherent fixed property B) A completely controllable variable C) A negligible factor in modern systems D) An unpredictable random variable that changes constantly
A) e B) i C) Hb D) p
A) Flips the input bit B) Erases the input bit C) Delays the input bit D) Duplicates the input bit
A) Memory B) Zero capacity C) Gaussian noise D) Ternary input |