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