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