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