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