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
It analogous to -> It is analogous to | 758 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
corrections thread
Authored by: Anonymous on Saturday, October 13 2012 @ 09:31 PM EDT
Not all computer hardward is necessarily built on OR, AND,
and NOT gates. It's common to build those gates out of NAND
gates. It doesn't undermine the underlying argument, but it
should be rewritten to avoid implying that all hardware works
like that.

[ Reply to This | Parent | # ]

Words missing in last para of footnotes
Authored by: Anonymous on Saturday, October 13 2012 @ 11:09 PM EDT
The last paragraph of the footnotes, first sentence -- seems to be missing
a few words? Something like:

"Programs intended to [be executed by] software implementations of
some universal algorithm..."

[ Reply to This | Parent | # ]

It analogous to -> It is analogous to
Authored by: feldegast on Sunday, October 14 2012 @ 01:08 AM EDT
no text

---
IANAL
My posts are ©2004-2012 and released under the Creative Commons License
Attribution-Noncommercial 2.0
P.J. has permission for commercial use.

[ Reply to This | Parent | # ]

The text of program implemented : program->a program [N/T]
Authored by: bugstomper on Sunday, October 14 2012 @ 01:17 AM EDT

[ Reply to This | Parent | # ]

If we use a pencil they are marks of lead on paper.
Authored by: feldegast on Sunday, October 14 2012 @ 01:19 AM EDT
graphite??
otherwise so many school children would get poisoning....

---
IANAL
My posts are ©2004-2012 and released under the Creative Commons License
Attribution-Noncommercial 2.0
P.J. has permission for commercial use.

[ Reply to This | Parent | # ]

The semantics of some programming languages has been -> have been
Authored by: bugstomper on Sunday, October 14 2012 @ 01:23 AM EDT
If it is multiple programming languages it is multiple semantics.

[ Reply to This | Parent | # ]

there is in mathematics --> there are in mathematics
Authored by: grokpara on Sunday, October 14 2012 @ 04:22 AM EDT
In the sentence "In particular there is in mathematics random mathematical
processes called stochastic processes."

[ Reply to This | Parent | # ]

On cannot ---> One cannot (N/T)
Authored by: Anonymous on Sunday, October 14 2012 @ 08:24 AM EDT

[ Reply to This | Parent | # ]

read the bits -> know what the bits mean
Authored by: nsomos on Sunday, October 14 2012 @ 09:00 AM EDT
PoIR wrote ...

If you don't know which one he chose you can't read the bits.

perhaps should be

If you don't know which one he chose you can't know for sure what the bits
mean.

You can certainly 'read' the bits, but it is the
interpretation of those bits which cannot be certain.

[ Reply to This | Parent | # ]

0.5V-->5V, 0,35V-->3.5V
Authored by: Anonymous on Sunday, October 14 2012 @ 10:31 AM EDT
Unless you are thinking of LVDS or somesuch. Admittedly, on-chip and
CPU bus voltages are trending lower, because less power is used in
changing states.
(Christenson)
P.S. excellent reminder that there's nine ways to skin the algorithmic cat!
Can this be cleaned up and submitted as an Amicus brief?

[ Reply to This | Parent | # ]

Missing html entities
Authored by: Anonymous on Sunday, October 14 2012 @ 01:12 PM EDT
There are places that have the sequence —, but what the original has should be
placed into html as —

Three places in the 2nd and 4th paragraphs of the quote from MySpace, Inc. v.
GraphOn Corp.

[ Reply to This | Parent | # ]

Bits are copyrightable
Authored by: Anonymous on Sunday, October 14 2012 @ 01:24 PM EDT
Footnote 6. "Bits are copyrightable whether or not they are watched by
humans."

It would probably be more accurate to say that "Sequences of bits are
copyrightable.."

I doubt a single bit or a random collection of bits is copyrightable.

[ Reply to This | Parent | # ]

rest mass
Authored by: Anonymous on Sunday, October 14 2012 @ 06:04 PM EDT
E=mC^2 does not imply that the mass, m, needs to be the rest
mass. For instance the rest mass of a photon is zero, but the
energy of a photon is given by Panck's formula E = h v (I use
v for I can't show Greek letters with this keyboard). If we
apply E=mC^2 to the photon we deduce that its "non-rest mass"
is m = hv/C^2 and its momentum is hv/C = mC both formulas
being correct even though the rest mass of the photon is zero.

In particle interactions both the energy and momentum must be
conserved so the photon has a mass for such interactions.

[ Reply to This | Parent | # ]

  • rest mass - Authored by: Anonymous on Monday, October 15 2012 @ 12:27 PM EDT
    • rest mass - Authored by: Anonymous on Monday, October 15 2012 @ 05:33 PM EDT
  • rest mass - Authored by: Anonymous on Tuesday, October 16 2012 @ 04:26 AM EDT
how does a computer carries -> how does a computer carry
Authored by: Anonymous on Sunday, October 14 2012 @ 07:36 PM EDT
Just a typo

[ Reply to This | Parent | # ]

An algorithm must be machine executable.
Authored by: pcrooker on Sunday, October 14 2012 @ 11:13 PM EDT
Should this not be "An algorithm must be executable"? I can execute an
algorithm with pen and paper.

[ Reply to This | Parent | # ]

corrections thread
Authored by: Anonymous on Monday, October 15 2012 @ 03:00 AM EDT
YOU CAN USE LEGO PARTS TO CRETE COMPUTER.

THEN ITS MATTER OF MOVING THEM FROM PLACE TO PLACE, AND INTERPRETING THEIR
PRESENCE OR ABSENCE.

It was proved that you can build full turring machine from standard lego parts
(only limited in computation power by number of available parts and speed of
physical movement).

Some nice video here:
http://www.youtube.com/watch?v=FTSAiF9AHN4

[ Reply to This | Parent | # ]

Formulae and algorithms
Authored by: Anonymous on Monday, October 15 2012 @ 09:15 AM EDT
"The formula is not the algorithm. This procedure is the algorithm. Someone
with sufficient skills in mathematics will know the algorithm simply by looking
at the formula."

The formula is actually describing at least three different algorithms. The one
you described, and at least one for finding each of the other two variables.
(Yes, c is a constant, but you could theoretically use this formula to get an
accurate value for it. Not sure how though)

Commutative operations are so nice, you only realise how nice they are when
you're forced to work ina space without them.

Not sure if this is actually relevent or not.

[ Reply to This | Parent | # ]

phenomenons -> phenomena
Authored by: Anonymous on Monday, October 15 2012 @ 04:30 PM EDT
In 3rd paragraph of section "Data and Computations Are Contents"

[ Reply to This | Parent | # ]

"...writing the symbols." > '...representing the symbols.'
Authored by: Tinstaafl on Monday, October 15 2012 @ 05:50 PM EDT
"There is no way of carrying out a mathematical computation without
actually *writing* the symbols." (my emphasis)

What about mental calculation? And if a machine makes the marks in some memory
space is stilled called writing? I don't think it's correct to use the term
'writing'. Perhaps 'representing' instead?

"There is no way of carrying out a mathematical computation without
actually representing the symbols."

[ Reply to This | Parent | # ]

0.5V -> 5.0V, 0.35V -> 3.5V
Authored by: Marc Mengel on Thursday, October 25 2012 @ 12:34 PM EDT
I"m pretty sure the "usual" TTL gates use 0 and 5 volts,
while newer circuits drop it to 0 and 3.5 volts. It's
listed as 0.5V and 0.35V various places...

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