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