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