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