Turing completeness

Question

So one can say a language is Turing complete if it meets some criteria, and it can do anything another Turing complete language can do.

Does that mean I can theoretically implement Google using JavaScript or Brainf_ck?

Answer 1

You can implement Google from a stack machine made of matchboxes and rocks. Yabba-Dabba-Doo?

Answer 2

No, for given examples it would be impossible. Turing completness is about implementing algorightms and such things, it won't tell you if you cant implememnt any software in it. Google depends mostly on their databases which you can't operate directly through JavaScript, ergo no DB == no Google.