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
au contraire | 360 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
au contraire
Authored by: Anonymous on Tuesday, May 08 2012 @ 11:55 PM EDT
It's both.

Computers are like Universal Turing machines, except for two things -- they
don't have an infinite amount of memory, and they aren't limited to scrolling up
and down a tape accessing only one cell of it at a time. But this only changes
how fast they compute, it doesn't change the set of problems that are
computable. A Universal Turing machine (and every general-purpose computer)
executes the same algorithm, which allows it to perform any computation which a
custom-built Turing machine (or any digital electronic circuit) could do.

In essence, they can compute anything that is computable. "Software"
is just a description of the computation to do. It's just a big long algorithm,
which probably reuses lots of shorter and simpler algorithms as building blocks
to do what it does.

Code is data, and data is code. All of it is input to the general-purpose
computer, and all of it is abstract and mathematical and should be unpatentable
for the same reasons that math is considered unpatentable. Nobody can invent
new mathematics, they can only discover it. And allowing one party to
monopolize the discovered ideas just hinders progress for all of us. This is as
true of software as it is of mathematics -- probably more true, because there
are far more programmers out there than practicing mathematicians, and complex
software is used in far more walks of life than advanced mathematics is (and
most of the basic math that is widely used in people's everyday lives, has been
in the public domain for hundreds of years...)

[ 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 )