scientific article
From MaRDI portal
zbMath0271.94018MaRDI QIDQ3214803
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Information theory (general) (94A15) Recursive functions and relations, subrecursive hierarchies (03D20) Algorithms in computer science (68W99)
Related Items
Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series, A comparison of LMC and SDL complexity measures on binomial distributions, Randomness and reducibility, Generation of symmetric exponential sums, A Note on Blum Static Complexity Measures, The structural complexity of DNA templates -- implications on cellular complexity, The dimensions of individual strings and sequences, Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts, Mutual dimension and random sequences, Protein synthesis as an object of physical and mathematical research and modeling, Universal computation and physical dynamics, Phase transitions in tumor growth. V: What can be expected from cancer glycolytic oscillations?, On universal prediction and Bayesian confirmation, `Ideal learning' of natural language: positive results about learning from positive evidence, The Kolmogorov complexity of infinite words, Algorithmic complexity as a criterion of unsolvability, Characterization of time series via Rényi complexity-entropy curves, An algebraic measure of complexity, Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report), Generalized information theory, Finite problems and the logic of the weak law of excluded middle, Concentration theorems for entropy and free energy, Individual communication complexity, Introduction: computability of the physical, Algorithmic thermodynamics, Kolmogorov-Loveland stochasticity for finite strings, Algorithmic complexity of quantum capacity, Complexity factor for black holes in the framework of the Newman-Penrose formalism, On the advice complexity of the \(k\)-server problem, Computable model discovery and high-level-programming approximations to algorithmic complexity, Clustering with respect to the information distance, A network of autoregressive processing units for time series modeling, On a posteriori error estimation using distances between numerical solutions and angles between truncation errors, Universality probability of a prefix-free machine, Leveraging environmental correlations: the thermodynamics of requisite variety, Universal probability-free prediction, Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem, An additivity theorem for plain Kolmogorov complexity, Axiomatizing Kolmogorov complexity, One-way functions using algorithmic and classical information theories, Comment on the Shiner-Davison-Landsberg measure, Nonreducible descriptions for the conditional Kolmogorov complexity, An algorithmic look at financial volatility, Simplicity and likelihood: an axiomatic approach, An All-or-Nothing Flavor to the Church-Turing Hypothesis, Physical complexity of symbolic sequences, Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, New applications of the incompressibility method. II, Revisiting Chaitin's incompleteness theorem, Kolmogorov Complexity as a Language, Equidistribution, uniform distribution: a probabilist's perspective, On the Advice Complexity of the k-Server Problem, Nonlinear manifold learning for early warnings in financial markets, Relevant states and memory in Markov chain bootstrapping and simulation, Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness, Time-universal data compression, Process complexity and effective random tests, Does the polynomial hierarchy collapse if onto functions are invertible?, Transition matrix analysis of earthquake magnitude sequences, Kolmogorov complexity for possibly infinite computations, Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets, Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, Representation theorem of observables on a quantum system, Mathematics as information compression via the matching and unification of patterns, Shannon entropy rate of hidden Markov processes, Approximating multivariate Markov chains for bootstrapping through contiguous partitions, Multivariate multiscale complexity-entropy causality plane analysis for complex time series, An algorithmic view of pseudochaos, Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods, Optimal stochastic control, A theory of incremental compression, An announce of results linking Kolmogorov complexity to entropy for amenable group actions, The calculi of emergence: Computation, dynamics and induction, Anisotropic star models in the context of vanishing complexity, Sets with small generalized Kolmogorov complexity, Randomness: Quantum versus classical, Randomness is inherently imprecise, Inequalities for Shannon entropy and Kolmogorov complexity, Biology as a constructive physics, Approximating Markov Chains for Bootstrapping and Simulation, Testing randomness online, On the application of algorithmic information theory to decision problems, On the complexities of de-Bruijn sequences, Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise, Entropy concepts and DNA investigations, Applying MDL to learn best model granularity, Finite degree clones are undecidable, Information and complexity, or: where is the information?, Average-case analysis of algorithms using Kolmogorov complexity, Krylov complexity and orthogonal polynomials, The descriptive complexity of Brownian motion, Experimental investigation of forecasting methods based on data compression algorithms, Complexity factor for static cylindrical system in energy-momentum squared gravity, A new complexity measure: modified discrete generalized past entropy based on grain exponent, Sequential predictions based on algorithmic complexity, A study of the fractal character in electronic noise processes, A comparison of two approaches to pseudorandomness, Interlacing and smoothing: combinatorial aspects, Algorithmic analysis of irrational rotations in a single neuron model, MEASURES OF UNCERTAINTY AND INFORMATION BASED ON POSSIBILITY DISTRIBUTIONS, Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT, A Quest for Algorithmically Random Infinite Structures, II, The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework, Kolmogorov Complexity-Based Similarity Measures to Website Classification Problems: Leveraging Normalized Compression Distance, The average‐case area of Heilbronn‐type triangles*, Algorithmic arguments in physics of computation, [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge], Inequalities for space-bounded Kolmogorov complexity, Volume and Entropy of Regular Timed Languages: Discretization Approach, Inductive inference of recursive functions: Complexity bounds, Multiscale structural complexity of natural patterns, Algorithmic complexity of points in dynamical systems, Complexity oscillations in infinite binary sequences, Unnamed Item, Unnamed Item, [https://portal.mardi4nfdi.de/wiki/Publication:5617399 �ber die Definition von effektiven Zufallstests], INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH, Statistical properties of finite sequences with high Kolmogorov complexity, HOW DIFFICULT IS IT TO INVENT A NONTRIVIAL GAME?, DECISION TREES DO NOT GENERALIZE TO NEW VARIATIONS, A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy, Analytical complexity and signal coding, Randomness as an invariant for number representations, Second Thoughts on the Second Law, Minimal-program complexity of pseudo-recursive and pseudo-random sequences, Relations between varieties of kolmogorov complexities, Universal Recursively Enumerable Sets of Strings, High end complexity, Alan Turing and the Foundation of Computer Science, THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES, Stochastic design of imaging parameters for self-similar patterns, An incompressibility theorem for automatic complexity, Mathematics of Analog‐to‐Digital Conversion, On problems for which no oracle can help, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, Search for Sparse Active Inputs: A Review, Configuration complexity assessment of convergent supply chain systems, Complexity and meaning in nonlinear dynamical systems, Algorithmic Statistics: Normal Objects and Universal Models, Recursively enumerable reals and Chaitin \(\Omega\) numbers, Unnamed Item, Unnamed Item, Stochastic complexity and the mdl principle, New error bounds for Solomonoff prediction, Predictability: a way to characterize complexity, Regression Estimation from an Individual Stable Sequence, Relations between information criteria for model-structure selection Part 2. Modelling by shortest data description, A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings, Descriptive complexity of computable sequences, Combinatorial interpretation of Kolmogorov complexity, Information distance and conditional complexities, W. Ross Ashby: a pioneer of systems science, One or Many Concepts of Information?, Artificial sequences and complexity measures, Quasi-Monte Carlo methods and pseudo-random numbers, Amount of Nonconstructivity in Finite Automata, Kolmogorov Complexity and Model Selection, Unnamed Item, Observations on Computability, Uncertainty, and Technology, Strong noncomputability of random strings, Algorithmic Fractal Dimensions in Geometric Measure Theory, Statistical learning theory, model identification and system information content, Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets, Kolmogorov complexity arguments in combinatorics, Measuring prime program complexity, Predictive stochastic complexity and model estimation for finite-state processes, Complex systems, complexity measures, grammars and model-inferring, Computational depth and reducibility, Relating and contrasting plain and prefix Kolmogorov complexity, Sequence similarity measures based on bounded Hamming distance, The renormalized entropy -- an appropriate complexity measure?, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, On the notion of infinite pseudorandom sequences, From time series to linear system, III: Approximate modelling, Sophistication revisited, Large alphabets and incompressibility, The representation and manipulation of the algorithmic probability measure for problem solving., One way functions and pseudorandom generators, On the capabilities of multilayer perceptrons, Tape versus queue and stacks: The lower bounds, On generalized computable universal priors and their convergence, What is a complex system?, Random problems, Tolstoy's mathematics in ``War and peace, The discovery of algorithmic probability, Stochastic complexity in learning, A natural encoding scheme proved probabilistic polynomial complete, An unpredictability approach to finite-state randomness, On randomness, determinism and computability, The critical roles of information and nonequilibrium thermodynamics in evolution of living systems, Notes on the essential system to acquire information, Information dissipation in quantum-chaotic systems: Computational view and measurement induction, Entropy and algorithmic complexity in quantum information theory, Universal computably enumerable sets and initial segment prefix-free complexity, Reexamination of an information geometric construction of entropic indicators of complexity, Strict process machine complexity, Genus distributions for iterated claws, A catalog of Boolean concepts., Depth-based complexity traces of graphs, Towards a theory of chance - Part II, Distribution of investments in the stock market, information types, and algorithmic complexity, The generalized universal law of generalization., Information theory: A multifaceted model of information, Elementary differences between the degrees of unsolvability and degrees of compressibility, Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov), A linearly computable measure of string complexity, Minimum message length encoding and the comparison of macromolecules, Low-depth witnesses are easy to find, Constraints placed on random sequences by their compressibility, Milking the Aanderaa argument, Impugning randomness, convincingly, New probability theory compatible with the new conception of modern thermodynamics. Economics and crisis of debts, Metric and probabilistic information associated with Fredholm integral equations of the first kind, Hierarchical content classification and script determination for automatic document image processing., Algorithmic randomness of continuous functions, Complexity of functions: Some questions, conjectures, and results, Algorithmic complexity of recursive and inductive algorithms, Random languages for nonuniform complexity classes, Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs, Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes, Universal forecasting algorithms, Almost everywhere high nonuniform complexity, Inductive reasoning and Kolmogorov complexity, A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping, Identification of probabilities, A universal statistical test for random bit generators, Sophistication vs logical depth, Global optimization test problems based on random field composition, Predictive analog-to-digital conversion for resistance to data outliers, Universal recursively enumerable sets of strings, Randomness on computable probability spaces -- a dynamical point of view, Note on the topological structure of random strings, On the algorithmic complexity of static structures, The extent and density of sequences within the minimal-program complexity hierarchies, Information measures for infinite sequences, Universal codes as a basis for time series testing, Measures of uncertainty for imprecise probabilities: an axiomatic approach, Nonapproximability of the normalized information distance, Using information theory approach to randomness testing, Generalized probabilities taking values in non-Archimedean fields and in topological groups, On the inference of optimal descriptions, Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega, On the distribution function of the complexity of finite sequences, Model discrimination using an algorithmic information criterion, On common information, Ergodic theorems for individual random sequences, Non-stochastic infinite and finite sequences, Recursively compressible sets, Learning problem for functional programming and model of biological evolution, Toward an abstract theory of data compression, On the relation between descriptional complexity and algorithmic probability, Complexity lower bounds for machine computing models, On two-tape real-time computation and queues, On the syntactic structure of protein sequences and the concept of grammar complexity, Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit, An upward measure separation theorem, An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape, Uncontrollable computational growth in theoretical physics, Fluctuation spectroscopy, A comparative classification of complexity measures, Spatial patterns in nonequilibrium hierarchical systems, Identifying randomness given by high descriptive complexity
