I saw that you also posted this on the "Puzzle transaction thread", if you can clarify the main goal for asking this, people can give you more tailored answers.
If it's simply creating an address without a pubKey or prvKey, then as others' have said: Yes.
If there's more to it, then please expand the question.
In fact, you can just use RNG to generate a pseudo-random 160-bit number, prepend with 0x00 and append with 0x01 then "base58check" encode that, and you got a compressed legacy address.
You can skip all those steps in your script (no hash required) and you'll still be able to generate an address that has no public/private key.
I just wonder is there possible collision in hash sha256 or in hash RMD160? because with different input method (bytes, string or integer) will give different output too. or public key is possible to substitute with some integer that represent public key it self (compressed, uncomp or in X,Y coordinate). Maybe all above response is correct if that both address is have no pvkey & pubkey and just create by hash only (in other words unspendable address). Or we are just waiting quantum computer to execute shor algo for brute all address in 256 bits space to prove that address have pvkey and pubkey or not.
**PS
sorry for my english, just translated