Re: Exploiting limitations of Turing machines in Turing tests?
- From: Barb Knox <see@xxxxxxxxx>
- Date: Tue, 02 Oct 2007 13:03:34 +1200
In article <fdqlgq$itk$1@xxxxxxxxxxxxxx>,
Antti Valmari <ava@.c.s...t.u.t...f.i.invalid> wrote:
[snip]
There is strong evidence to the claim that anything that can be computed
with a physically realistic computer, can be computed with a Turing
machine.
For one thing, many seemingly different computational models have been
suggested. Some of them have proven strictly weaker than Turing
machines, and most of them have the same computational power as Turing
machines. None of them is stronger than Turing machines, except those
which contain a physically unrealistic element to start with
Not entirely true. One thing that the physical universe seems to have
that TMs do not is true randomness. But it's doubtful that that's a
significant limitation, since pseudo-randomness can come arbitrarily
close.
--
---------------------------
| BBB b \ Barbara at LivingHistory stop co stop uk
| B B aa rrr b |
| BBB a a r bbb | Quidquid latine dictum sit,
| B B a a r b b | altum viditur.
| BBB aa a r bbb |
-----------------------------
.
- Prev by Date: Re: Exploiting limitations of Turing machines in Turing tests?
- Next by Date: Re: Subset sum problem: probabilistic fast testing algorithm...
- Previous by thread: Re: Exploiting limitations of Turing machines in Turing tests?
- Next by thread: Re: Exploiting limitations of Turing machines in Turing tests?
- Index(es):
Relevant Pages
|
