Back to Discover
🔢

Computably enumerable set

math Maturity 11-13

A machine can make a long list.

Recursive enumeration of all halting Turing machines.gif
Recursive enumeration of all halting Turing machines.gif
It can find things one by one. It keeps going and going. This helps us find what we need. It is like a never-ending list. Can you think of a long list?
Recursive enumeration of all halting Turing machines.gif
Recursive enumeration of all halting Turing machines.gif

53 words
🖼️ Images & Media (1)
File:Recursive enumeration of all halting Turing machines.gif
Recursive enumeration of all halting...
Up Next
🔢
Computable set
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Computable set 0% Computable function 0% Decision problem 0% Turing degree 0% Turing reduction 0% Computability theory 0%

🔬 Go deeper

More advanced topics to explore

Computable function Decision problem Turing reduction Computability theory

🪜 Step back

Simpler topics to build understanding

Computable set Turing degree Constructible function Turing's proof
📚 Content adapted from Wikipedia | Readability: FK 10.5 | Vital Level 5