absolutely fucking love it . thanks for sharing ! <| sep |> Holy shit . This is some crazy bullshit on spez ' s part right here . What the fuck was he thinking ? It ' s been a long weekAnd that somehow partially justifies it ? Really ? Fucking really ? <| sep |> The last one , with SV , Godtenks and Base Black <| sep |> They want to run the score up after we embarrassed them last time we met <| sep |> exact jacket on Grailed unless you are the user on grailed can you provide a time stamp and date along the jacket with a card so we know it ' s real ? <| sep |> Sauce sauce sauce <| sep |> Python 3 Is Not Turing Complete In computer science a fundamental law is that if I have one Turing Machine I can build any other Turing Machine . If I have COBOL then I can bootstrap a compiler for FORTRAN as disgusting as that might be . If I have FORTH , then I can build an interpreter for Ruby . This also applies to bytecodes for CPUs . If I have a Turing Complete bytecode then I can create a compiler for any language . The rule then can be extended even further to say that if I cannot create another Turing Machine in your language , then your language cannot be Turing Complete . If I can ' t use your language to write a compiler or interpreter for any other language then your language is not Turing Complete . Currently you cannot run Python 2 inside the Python 3 virtual machine . Since I cannot , that means Python 3 is not Turing Complete and should not be used by anyone . I don ' t believe this . PyPy 3 does this , I think . Moreover , it doesn ' t matter . C isn ' t turing complete , but it is still very useful . From the esolang wikicomplete # Overspecification An interesting example of this is the C programming language . The C specification requires an integer result from sizeof operator . The sizeof operator ' s result is an unsigned integer , of type sizet , for ANSI C , or an int or long for traditional C . The range of these integers is bounded . Since the sizeof any object in a C implementation must be a finite size , then C cannot be Turingcomplete , because it cannot address an unbounded storage space .