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