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