Turing-complete

Alas, the machine was either too mechanically complex for the time, or the financial and political will were lacking, and the first digital, programmable, and Turing-complete machine, the Zuse Z3, would not be built until 1941.

Introducing the Babbage-Boole Rodulator « The Half-Baked Maker 2009

It seems like an abuse of the term to call a standards-compliant web browser like Safari running on a Turing-complete operating system like Mac OS X “gated communities”.

Matthew Yglesias » This Post Written on Chrome for Mac 2009

Not everything needs to converge to become a Free and Open, Turing-complete, net-neutral web machine.

The death of the URL | FactoryCity 2009

However, I have heard of ENIAC, which, as Wikipedia puts it, was "the first purely electronic, Turing-complete, digital computer capable of being reprogrammed to solve a full range of computing problems".

Invisible Computers Peggy 2008

However, I have heard of ENIAC, which, as Wikipedia puts it, was "the first purely electronic, Turing-complete, digital computer capable of being reprogrammed to solve a full range of computing problems".

Archive 2008-01-01 Peggy 2008

Ultimately, computer languages help us operate Turing machines, which means that any Turing-complete language will allow you to do anything you want, contingent on effort.

The Importance of Language Neal Ford 2007

Charles Babbage came close to delivering a Turing-complete computer in the mid-19th century – almost a century ahead of the 1943 arrival of the first working Turing-complete computer, ENIAC.

The Speculist: Push or be Pulled 2006

Charles Babbage came close to delivering a Turing-complete computer in the mid-19th century – almost a century ahead of the 1943 arrival of the first working Turing-complete computer, ENIAC.

The Speculist: August 2006 Archives 2006

Oxytricha and Stylonychia, two ciliated protozoans, are Turing-complete biocomputers that rewrite their DNA to perform calculations.

Boing Boing: May 18, 2003 - May 24, 2003 Archives 2003

First off, he fails to acknowledge the intractatability of making DRM work -- providing an untrusted party with the key, the ciphertext and the cleartext but asking that party not to make a copy of your message is just silly, and can't possibly work in a world of Turing-complete computing.

Boing Boing: June 9, 2002 - June 15, 2002 Archives 2002