On Thu, Dec 08, 2016 at 02:07:54AM -0800, Rick Moen wrote:
> Quoting Dr. Nikolaus Klepp (dr.klepp@???):
>
> > Am Donnerstag, 8. Dezember 2016 schrieb Rick Moen:
> > > So, banning software patents is difficult, because of the ease of
> > > instantiating software in hardware.
> >
> > On the contrary, it's quite easy: what ever can be implemented using a
> > turing machine is not patentable.
>
> What _can't_ be implemented using a Turing machine?

Well, it's pretty likely things are quantized at or around Planck's length,
that makes everything integers, and thus the state of the Universe can be
represented in a finite number of bits (although the Planck's length is
smaller compared to atom diameter than observable universe is larger than
us, so you don't quite have that kind of storage...).

This makes every physically realizable machine implementable as a Turing
machine.

--
u-boot problems can be solved with the help of your old SCSI manuals, the
parts that deal with goat termination. You need a black-handled knife, and
an appropriate set of candles (number and color matters). Or was it a
silver-handled knife? Crap, need to look that up.