##  [Recursively Enumerable](/index.php/recursively-enumerable) 

  ##  [Recursively Enumerable](https://mathlogic.quantumdictionary.io/recursively-enumerable-0) 

  

 [![Mathematics & Logic Dictionary](/sites/default/files/styles/large/public/2026-01/Mathematics%20%26%20Logic.png.webp?itok=UhtTRPnp)](/index.php/topic-specific-dictionaries/natural-formal-sciences/mathematics-logic)

- Natural & Formal Sciences -

**Mathematics & Logic Dictionary**

 







 

 

 

 



 

 

 

 

Definition

Class of sets (languages) for which there exists a Turing machine that enumerates all members or, equivalently, accepts exactly the inputs in the set by halting and accepting on them; the machine may not halt on non-members.