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