Skip to main content
Dictionary
Store
Blog
World
Help
Advertise
Chat
System Status
Information Collection Notice
Trademark Concerns
reCAPTCHA Privacy
Terms of Service
reCAPTCHA Terms
Privacy Policy
Accessibility
Report a Bug
Data Request
Contact Us
Security
DMCA
© 1999–2026 Urban Dictionary ®
Mugs
Tees
Hoodies
Pro Customization
Create unique products with your own words and definitions
Preview
Personalize Your Design
Your Word
Your Definition
A Turing Machine defined as: A_TM = {<M,w>| M is a TM and M accepts w} This Machine test input w on all possible Turing Machine configurations M with the assumption of finding a Halt: accept/reject state. Notes about A_TM 1. It is undecidable 2. An Oracle TM can supposedly decide it. 3. Due to the halting problem it does not necessarily detect a halt. 4. It is a common TM to use in decidability reductions. For more information go to school, buy a book, or look online. Disclaimer- I'm Not responsible for your girlfriend dumping you when she finds out you're wasting your time on this.
Text fits
Save
Cancel