Accuracy in Media claims the the news media are biased toward liberal politics. Fairness & Accuracy in Media claims the the news media are biased toward conservative politics. Supporters of these views see one group as right and the other as wrong. But the reality is not that simple. Yes, AIM and FAIR each point out coverage that appears to bolster their various claims. At times, the media do seem to be biased one way or the other. What these groups don't say, however, is that their mistrust of the media is also a mistrust of the people. Those who complain most about media bias would see themselves as able to identify it and resist it. They get upset about it because they question whether the average American is able to do the same. If the average American can identify it and resist it, then there is little need to get upset about bias. The AIM and FAIR web sites are full of material to help hapless Americans avoid the cognitive ravages of the "evil" conservatives or the "slandering" liberals and their media lackeys. I believe the average American is quite capable of identifying problems with news coverage. In my opinion, crusading against political bias in the news media is an elitist practice.
The word 'efficiently' here means up to polynomial-time reductions . This thesis was originally called Computational Complexity-Theoretic Church–Turing Thesis by Ethan Bernstein and Umesh Vazirani (1997). The Complexity-Theoretic Church–Turing Thesis, then, posits that all 'reasonable' models of computation yield the same class of problems that can be computed in polynomial time. Assuming the conjecture that probabilistic polynomial time ( BPP ) equals deterministic polynomial time ( P ), the word 'probabilistic' is optional in the Complexity-Theoretic Church–Turing Thesis. A similar thesis, called the Invariance Thesis , was introduced by Cees F. Slot and Peter van Emde Boas. It states: "Reasonable" machines can simulate each other within a polynomially bounded overhead in time and a constant-factor overhead in space .  The thesis originally appeared in a paper at STOC '84, which was the first paper to show that polynomial-time overhead and constant-space overhead could be simultaneously achieved for a simulation of a Random Access Machine on a Turing machine.