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