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