output - Is a language built specifically to not print quines still turing complete? -


this question says that:

any programming language turing complete, , able output string (by computable function of string program — technical condition satisfied in every programming language in existence) has quine program (and, in fact, infinitely many quine programs, , many similar curiosities) follows fixed-point theorem.

now, create language x.. language x has following output handler:

public void outputhander( outputevent e ){   string msg = outputevent.getmessage();   string src = runtime.getsource();   if( msg.equals(src) ){     e.setmessage("");   } } 

as can see, prevents source being outputted in way shape or form. simple. interpreter language x checking it's source @ times on screen. if source found, it's deleted before hits screen. given empty program throw non-blank error, language x still turing complete? why?


Comments

Popular posts from this blog

What is happening when Matlab is starting a "parallel pool"? -

angular - DownloadURL return null in below code -

php - Cannot override Laravel Spark authentication with own implementation -