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