[ Main Page ]

知的財産法

論文の話題

初心者なりの解釈ですが、もとはセミナーの内容の抜粋で、かなり古い文書です。

Diamond v. Diehr et al / State Street Bank Co & Trust v. Signature Finalcial Group Co / Jazz Photo Corp. and Dynatec International, Inc. and Opticolor v. International Trade Commission and Fuji Photo Film
John v. Duke University / Embrex v. Service Engineering
Bayer HealthCare LLC v. Nagrom, Inc. / Gamut Trading Co. v. United States ITC
Sony Corp. of America v. Universal City Studios, Inc.
Eric Eldred v. John D. Ashcroft
The Future of Ideas by Lawrence Lessig
Danjaq LLC v. Sony Corp.

関連文書

米国における判例法上の試験免責とボーラー条項に関する判決の展開 増岡国久
「試験又は研究」の例外について
我が国における特許権の効力が及ばない「試験又は研究」について
IT時代における紙器・ダンボール業界の特許戦略
   <rindolf>  Pythack now was able to get the fc-solve test suite up and
              running.
       <Zuu>  eh?!
           *  Zuu solves rindolf
   <rindolf>  Zuu: http://fc-solve.berlios.de/
   <rindolf>  Zuu: I am not solvable.
   <rindolf>  I am Turing hard.
       <Zuu>  :S
           *  Zuu never heard of anything called 'turing hard'
 <joeyadams>  lol. Zuu's probabilistic, so maybe he can solve you.
       <Zuu>  but i guess i have now
 <joeyadams>  Formal definition of Turing hard: blah blah blah hard blah
              blah Turing blah.
       <Zuu>  Hahahaha :D
 <joeyadams>  Wikipedia: Given a set X in P(N), a set A in N is called
              Turing hard for X if X <=_T A for all X in X. If
              additionally A is in X, then A is called Turing complete for
              X.
 <joeyadams>  Does that clarify?
 <joeyadams>  (see http://en.wikipedia.org/wiki/Turing_reduction for the
              actual math symbols)
           *  joeyadams assumes you get the point
       <Zuu>  yeah, i think i'll have to put significant time into that,
              for me to comprehend it :)
       <Zuu>  but maybe i will, some day :P
 <joeyadams>  My point is that people like to use mumbo jumbo to describe
              more concise mumbo jumbo.
 <joeyadams>  E.g. A problem is NP-hard if it is at least as hard as all
              the problems in NP.
       <Zuu>  i undersstand enough of it, to be fairly confident that
              rindolf being turing hard, will not say much about his
              ability to be solved
 <joeyadams>  I'm guessing Turing-hard means you can't solve a problem
              with a Turing machine (e.g. the halting problem)
 <joeyadams>  (substitute Turing machine with "your computer" :) )
       <Zuu>  no, turing hard has something to do with expressiveness
 <joeyadams>  okay, Zuu > joeyadams, so I can't help you :)
           *  Zuu tickles joeyadams ^^
 <joeyadams>  A delicious apple is any fruit ��� apple that is at least as
              tasty as any other fruit ��� apple.
 <joeyadams>  In other words, apples are in the set of recursively
              nommable fruits.
   <rindolf>  joeyadams: what's up?
 <joeyadams>  I'm babbling.
   <rindolf>  joeyadams: Apple is one of my least favourite fruits.
           *  Zuu watches a number of apples that recursively NOM's
              eathother
   <rindolf>  It tends to be too commonplace.
   <rindolf>  Or simpleton.
 <joeyadams>  whoops, my logic is incorrect
 <joeyadams>  Only delicious apples are ��� the nommable fruits.
 <joeyadams>  (recursively is just a word you throw in to sound smart)
           *  Zuu NOMs joeyadams :>
   <rindolf>  joeyadams: a friend of one of my sisters said that Apple is
              his favourite fruit.
   <rindolf>  Ta-zuu!
           *  joeyadams has quit (Read error: 104 (Connection nommed by
              peer))
       <Zuu>  yeah, unfortunately a lot of people throw with a lot of
              words to sound smart :/
       <Zuu>  my favourite fruit is a recursive banana!
 <joeyadams>  although it certainly helps to use complex terminology to
              solve complex problems. As Aristophanes said, "High thoughts
              must have high language."
       <Zuu>  .. along with immutable polymorphic pears
 <joeyadams>  Zuu> I guess you have to peel it indefinitely?
 <joeyadams>  lol
       <Zuu>  Hahah, yeah :P
 <joeyadams>  I tend to eat bananas in deterministic polynomial time.
       <Zuu>  i eat them in linear time, but uses exponential space
 <joeyadams>  lol
   <rindolf>  Heh.
 <joeyadams>  eww

    -- Turing Hard
    -- ##programming, Freenode

Linus isn't saying that CVS and Subversion have fixable bugs or missing
features. It's not about the code.

He is saying that they solve the wrong problem. The Subversion team wants to
solve Problem A, and Linus wants to solve Problem B. No amount of code will
turn the solution to Problem A into a solution for Problem B. Bothering the
Subversion team with code addressing Problem B will only irritate them, since
they're working on Problem A.

The right way to handle differing goals is to start a different project.
That's what he did.

Don't be confused by the labels. Source Code Management means different things
to different people, and there isn't always much overlap in how each person
defines it. Ships and airplanes are both 'vehicles', but that doesn't mean
that a few changes will turn one to the other.

zzatz on:
http://developers.slashdot.org/comments.pl?sid=237163&cid=19367821

    -- zzatz
    -- Slashdot Comment ( http://developers.slashdot.org/comments.pl?sid=237163&cid=19367821 )


Powered by UNIX fortune(6)
[ Main Page ]