scientific article; zbMATH DE number 3559552

MaRDI QIDQ4132513zbMATH OpenFDO

Authors V. V. V'Jugin

Publication date 1976

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50) Computability and recursion theory (03D99)

Recommendations

• The typical Turing degree
• Degrees of randomized computability
• Arithmetical Measure
• Computability of measurable sets via effective topologies
• scientific article; zbMATH DE number 4128138

Cited in

(16)

• Non-stochastic infinite and finite sequences
• Computational depth and reducibility
• Turing cones and set theory of the reals
• Randomness for non-computable measures
• Indifferent Sets
• Limit Theorems for the Maximal Random Sums
• scientific article; zbMATH DE number 1738660 (Why is no real title available?)
• Computational depth and reducibility
• On Turing dynamical systems and the Atiyah problem
• Large Turing independent sets
• Degrees of randomized computability
• Turing invariant sets and the perfect set property
• Diagonally non-computable functions and fireworks
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• On empirical meaning of randomness with respect to parametric families of probability distributions
• On an open question regarding atoms in the Levin-V'yugin degrees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132513)