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