decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
You keep using that word. I do not think it means what you think it means. | 1347 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
You keep using that word. I do not think it means what you think it means.
Authored by: Marc Mengel on Monday, June 11 2012 @ 05:16 PM EDT
There are certain Theorems related to the Church-Turing thesis, which
demonstrate things like:

* The set of computations that can be performed by lambda calculus and the set
of computations that can be performed by Turing Machines are equivalent
* The set of computations that can be performed by memory/register computer and
those that can be performed by Turing Machines are equivalent.
* One tape, two-tape, and n-tape turing machines are all equivalent in what they
can compute.

These Turing-equivalence theorems are what most folks here are referring to.
All of your smart phones, desktop computers, etc. are all Turing machine
equivalents (assuming you have an endless supply of thumb drives/SD cards, to
provide sufficient storage).

While it's true no-one has proved the brain is actually
Turing-machine-equivalent, that is largely because folks don't really know how
the brain works with enough specificity to prove such a thing about it.

[ Reply to This | Parent | # ]

You keep using that word. I do not think it means what you think it means.
Authored by: Wol on Monday, June 11 2012 @ 07:58 PM EDT
I'm well aware of the difference between a theor*y* and a theor*em*. But I'm a
scientist, not a mathematician.

I just thought that Church-Turing *was* a theorem - sorry if I got it wrong.
But
it's pretty definitely a theory, isn't it? Or has somebody succeeding in doing
a
scientific proof on it :-) ?

Cheers,
Wol

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )