Yes, absolutely, but not for the commonly understood reasons. The problem is that although the intended way for program to pass the Turing Test is to simulate or emulate human intelligence through the unique(for now) human activity of communication via human language, the Turing Test is flawed and allows a significant shortcut:
Instead of focusing on emulating intelligence, a program can instead focus on fooling humans, which it turns out is not all that hard (as an endless number of "Nigerian Finance Ministers" have proven). ELIZA is the example most often given to demonstrate this, but IMHO, PARRY is the much more significant case as the ELIZA concept is limited because of the difficulty of extending it to larger communication & knowledge spaces, however there isn't really anything about PARRY that would prevent it from being scaled up to a huge level.
That this is possible was demonstrated some years ago by a Turing Test, where the part of the "Computer" being tested was played by a program that was also intercepting the communications to and from the Humans under test and then simply copying an answer to a question that most closely matched the one that it was just asked. This (again IMHO) is a shallower, though much broader example of the PARRY approach.
The inescapable conclusion is that we could readily develop a program, today, that could handily pass most of the even moderately limited Turing Tests if we just put the time and money into it (note: most Turing Tests conducted today are not moderately limited, but severely limited tests). How could this most easily be done? As follows:
Create a version of the Google spiders that constantly scans the Internet for textual exchanges and then store and categorize the responses by semantic analysis of the questions (or initiating text) and store it in a specialized version of the Google databases. Next constantly invite people to participate in on-line Turing Tests as both testers and testees. Record and catalog the dialogs as before but giving more weight to these exchanges.
Next, participate in Turing Tests, scoring itself on how often testers guessed that it was a computer. Finally use the type of massive tree-branching weighting & look-ahead search and move-selection algorithms used by Chess & Checkers programs currently (adapted for semantic analysis and exchange or course).
Now our program is ready for the real public Turing Tests. And of course while it is doing that continue to run low-profile Turing Tests of its own around the world, feeding it's questions/prompts that it receives from the real testers to those other folks and storing their responses as a backup for more complicated and involved situations. And of course, apply the first principle of Chess, Checkers and PARRY: Take control of the engagement, thus limiting the other side's options.
So, in short: the Internet can pass the Turing Test.