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