Math 2.0

Areas Computability theory Topic

Computable and computably enumerable sets

Summary

This topic is a part of computability theory. It covers the decidable and the semidecidable sets, their equivalent definitions and closure properties, and the first computably enumerable set that is not computable.

About this page
Tag24YMRP8DF5
URIm2://24YMRP8DF5
Kindtopic
WritingW0 stub
MSC03D25
Part ofComputability theory
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.