Is the language ${f(x)mid mbox{$x$ is the code of a machine accepting $f(x)$}}$ recursively...
Channel: Roel Van de Paar
Date: 2021-02-05

Is the language ${f(x)mid mbox{$x$ is the code of a machine accepting $f(x)$}}$ recursively enumerable and undecidable?

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user user47845 (cs.stackexchange.com/users/34151), user Rick Decker (cs.stackexchange.com/users/13107), user babou (cs.stackexchange.com/users/8321), and the Stack Exchange Network (cs.stackexchange.com/questions/43090). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com