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