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