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