Computable set
id:
computable-set-196-7868991
title:
Computable set
text:
In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time and correctly decides whether the number belongs to the set or not. A set which is not computable is called noncomputable or undecidable. A more general class of sets than the computable ones consists of the computably enumerable (c.e.) sets, also called semidecidable sets. For these sets, it is only requi
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in computability theory
original url:
https://en.wikipedia.org/wiki/Computable_set
date created:
date modified:
2022-08-23T10:05:55Z
main entity:
{"identifier":"Q877945","url":"https://www.wikidata.org/entity/Q877945"}
image:
fields total:
13
integrity:
14