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