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