scientific article; zbMATH DE number 3559552

MaRDI QIDQ4132513zbMATH OpenFDO

Authors V. V. V'Jugin

Publication date 1976

Mathematics Subject Classification ID

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

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

(13)

• Turing cones and set theory of the reals
• Computational depth and reducibility
• Randomness for non-computable measures
• On empirical meaning of randomness with respect to parametric families of probability distributions
• scientific article; zbMATH DE number 1738660 (Why is no real title available?)
• Turing invariant sets and the perfect set property
• Limit Theorems for the Maximal Random Sums
• On Turing dynamical systems and the Atiyah problem
• Degrees of randomized computability
• Computational depth and reducibility
• Indifferent Sets
• Non-stochastic infinite and finite sequences
• Diagonally non-computable functions and fireworks

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)