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