Closed Left-R.E. Sets (Q3010403)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Closed Left-R.E. Sets	scientific article

Statements

scholarly article

0 references

Closed Left-R.E. Sets (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

1 July 2011

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-20877-5_23

0 references

Incompleteness theorems for random reals

0 references

Algorithmic Randomness and Complexity

0 references

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

0 references

On the Lattice of Recursively Enumerable Sets

0 references

An introduction to Kolmogorov complexity and its applications

0 references

Solution of a problem of Tarski

0 references

Computability and Randomness

0 references

Classical recursion theory. The theory of functions and sets of natural numbers

0 references

Recursively enumerable sets of positive integers and their decision problems

0 references

Simplicity of recursively enumerable sets

0 references

Cohesive sets and recursively enumerable Dedekind cuts

0 references

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-20877-5_23

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3010403

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3010403&oldid=35236165"