Index Sets and Universal Numberings (Q3576059)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Index Sets and Universal Numberings	scientific article

Statements

scholarly article

0 references

Index Sets and Universal Numberings (English)

0 references

0 references

0 references

0 references

Mathematical Theory and Computational Practice

0 references

publication date

28 July 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03073-4_28

0 references

Control structures in hypothesis spaces: The influence on learning

0 references

Extremes in the degrees of inferability

0 references

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

0 references

Frequency computations and the cardinality theorem

0 references

Kolmogorov complexity and the Recursion Theorem

0 references

A proof of Beigel's cardinality conjecture

0 references

0 references

Program size in restricted programming languages

0 references

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

0 references

Classical recursion theory. Vol. II

0 references

A cardinality version of Beigel's nonspeedup theorem

0 references

Classes of Recursively Enumerable Sets and Their Decision Problems

0 references

A guided tour of minimal indices and shortest descriptions

0 references

On the Turing degrees of minimal index sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-03073-4_28

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3576059

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