by Ciro Santilli (@cirosantilli, 36)
Set of all decision problems solvable by a Turing machine, i.e. that decide if a string belongs to a recursive language.

Ancestors (10)

  1. Recursive language
  2. Recursively enumerable language
  3. Chomsky hierarchy
  4. Formal language theory
  5. Computer science
  6. Computer
  7. Information technology
  8. Area of technology
  9. Technology
  10. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

R (complexity) by Wikipedia Bot 0 1970-01-01
Read the full article
See all articles in the same topic + Create my own version