English Kolmogorov complexity Cited by user Cosmia Nebula on 28 Jan 2024 In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a…
Spanish Conjunto recursivamente enumerable Cited by user Mollejasaurio on 21 Feb 2023 En la teoría de la computabilidad, un conjunto S de números naturales se denomina computablemente enumerable (ce), recursivamente enumerable (re), semidecidible…
English Computably enumerable Cited by user Mathnerd314159 on 29 Nov 2021 In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable…
English Algorithmic information theory Cited by user RDBrown on 08 Mar 2020 Algorithmic information theory (AIT) is a "merger of information theory and computer science" that concerns itself with the relationship between computation and…