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