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