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