scientific article; zbMATH DE number 3559552

zbMATH Open0359.02041MaRDI QIDQ4132513FDOQ4132513

Authors: V. V. V'Jugin 

Publication date: 1976

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (13)

• Turing cones and set theory of the reals
• Randomness for non-computable measures
• Computational depth and reducibility
• Title not available (Why is that?)
• On empirical meaning of randomness with respect to parametric families of probability distributions
• 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)