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