recursively enumerable set (Q676835)

From Wikidata
Jump to navigation Jump to search
a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
  • computably enumerable set
  • c.e. set
  • r.e. set
  • semidecidable set
  • partially decidable set
  • listable set
  • provable set
  • Turing-recognizable set
  • provable
edit
Language Label Description Also known as
English
recursively enumerable set
a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
  • computably enumerable set
  • c.e. set
  • r.e. set
  • semidecidable set
  • partially decidable set
  • listable set
  • provable set
  • Turing-recognizable set
  • provable

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit