Random Strings and Tt-Degrees of Turing Complete C.E. Sets

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-10(3:15)2014
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

Cone Avoidance of Some Turing Degrees

Journal of Mathematics Research
2017English

Measure and Cupping in the Turing Degrees

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2012English

Quasi-Delay-Insensitive Circuits Are Turing-Complete

1995English

Random Access to Grammar-Compressed Strings

2011English

Random Access to Grammar-Compressed Strings and Trees

SIAM Journal on Computing
MathematicsComputer Science
2015English

Complete Pairs of Coanalytic Sets

Fundamenta Mathematicae
Number TheoryAlgebra
2007English

Strong Reductions and Isomorphism of Complete Sets

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2014English

Complete Sets of Orthogonal Tableaux

English

Limitations of Efficient Reducibility to the Kolmogorov Random Strings

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy