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