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