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