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