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