Groklaw - Digging for Truth

	When you want to know more...

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

You won't find me on Facebook

Donate

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:

On servers donated to ibiblio by AMD.

Webmaster

Re: Computational complexity... | 135 comments | Create New Account

Comments belong to whoever posts them. Please notify us of inappropriate comments.

Re: Computational complexity...

Authored by: Anonymous on Monday, June 10 2013 @ 11:03 AM EDT

You come up with a mathematical definition of "human brain" and then
we can talk about how that mathematical concept is related to the mathematical
concept of a "Turing machine". Don't try to apply mathematical
concepts directly to the real world. You need to construct a "model"
first.

We can't prove the universe isn't finite. If it is finite then everything in the
real world is mathematically rather trivial, like a "dictionary" in
your terminology. But that doesn't stop us from having the concept of
"infinite memory".

What on earth has this got to do with Groklaw?

By the way, we already have the concept of a "non-deterministic Turing
machine", which is more powerful than a Turing machine.

[ Reply to This | Parent | # ]

Re: Computational complexity... - Authored by: Anonymous on Tuesday, June 11 2013 @ 03:28 AM EDT

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 )