To clarify, Computers can't pass turing tests because the answer is divergent, or in other words has multiple possible answers. There may be some incompleteness issues as well.
Computers require determinism as a system's property to function and do work. It can't do work if there is more than one path, or single series of steps given the same state inputs.
Besides, computers can have a source of true randomness. This means they are no longer a Turing Machine, but they never were anyway (no infinite tape).
If you want to correct that mistake I'd suggest taking a Computer Science Compiler Design course, its the material normally covered in what's known as the dragon book.
> source of true randomness ... This means they are no longer a Turing Machine
Wishful thinking doesn't make it so, I've included an example below, also PRNGs even with random inputs to help with randomness aren't true randomness.
In the interest of not sniping, I'll put it plainly. You clearly do not know what you are supposed to know if that were true.
There's no point in me talking to you any further, you've lost all credibility.
If you're going to be condescending the least you could do is be correct.
> Computers can't pass turing tests because the answer is divergent, or in other words has multiple possible answers.
This is wrong. Computers can absolutely pass Turing tests; an obvious example is ChatGPT. Not sure what you mean by divergent, to my knowledge it's not a technical term in this context. Given that you use it as an explanation for an obviously false statement I'm not going to even try and interpret it.
I've seen you arguing in with other people this thread. Instead of claiming that others have no credibility you should instead examine your own. FYI, probabilistic Turing machines and Turing machines are the same in the same way that Javascript and Java are the same.