百度翻译vs谷歌翻译

开放给广大用户的在线翻译是百亿市值和千亿市值的一个体现：

原文：Figure 1 presents commented pseudo-code for the nonblocking queue data structure and operations. The algorithm implements the queue as a singly-linked list with Head and Tail pointers. As in Valois’s algorithm, Head always points to a dummy node, which is the first node in the list. Tail points to either the last or second to last node in the list. The algorithm uses compare and swap, with modification counters to avoid the ABA problem. To allow dequeuing processes to free dequeued nodes, the dequeue operation ensures that Tail does not point to the dequeued node nor to any of its predecessors. This means that dequeued nodes may safely be re-used.

百度翻译如下：

谷歌翻译如下：

可能是百度在施行“超英赶美”的计划，无暇顾及惠民工程。 不过话还是要落在重点上，可能百度的600亿不算什么，也是穷人一枚，所以只会顾及“个人利益”。