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