(adsbygoogle = window.adsbygoogle || []).push({}); Complement of Universal Turing Machine - Does this exist??

I am kind of confused in terms of the creation of machine which does NOT (Universal Turing Machine). I mean I construct a TM which will simulate UTM and accept strings it rejects and rejects strings it accepts. So if L(UTM) defined as <M,w> = <Turing Machine (TM) Description,string passed which is accepted by TM> is recognizable by UTM then L'(UTM) should be recoginizable by NOT(UTM) which is also a TM. But then if L(UTM) and L'(UTM) is turing recognizable then L(UTM) becomes decidable which is wrong as that is the crux of Turing and in turn Godel's undecidability theorem. So I MUST be missing some fundamental point here and not sure what that is. Please Help!!

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Complement of Universal Turing Machine - Does this exist?

Loading...

Similar Threads - Complement Universal Turing | Date |
---|---|

I Existential Import paper by Corcoran and Massoud | Jan 7, 2017 |

The union of a subset and its complement | Feb 27, 2014 |

Boolean algebra: complement | Sep 19, 2012 |

Determining the number of elements in the relative complement of a set | Apr 20, 2012 |

What is complementation wrt a sigma-algebra? | Jun 11, 2010 |

**Physics Forums - The Fusion of Science and Community**