|
|
|
|
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Here's an interesting thought:
There is no Turing machine capable of translating a Turing machine program
into an input tape for a Universal Turing Machine.
--
Darren New, San Diego CA, USA (PST)
"Oh no! We're out of code juice!"
"Don't panic. There's beans and filters
in the cabinet."
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Em 05/04/2012 23:56, Darren New escreveu:
> Here's an interesting thought:
>
> There is no Turing machine capable of translating a Turing machine
> program into an input tape for a Universal Turing Machine.
LOLWUT?
gotta sleep...
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 06/04/2012 03:56 AM, Darren New wrote:
> Here's an interesting thought:
>
> There is no Turing machine capable of translating a Turing machine
> program into an input tape for a Universal Turing Machine.
Turning machines only take tapes as input. To convert a Turning machine
into a tape, it would /already/ have to be a tape so it could be input. :-P
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Orchid Win7 v1 <voi### [at] devnull> wrote:
> Turning machines only take tapes as input. To convert a Turning machine
> into a tape, it would /already/ have to be a tape so it could be input. :-P
What's a turning machine?
--
- Warp
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
> What's a turning machine?
My keyboard hates me. Possibly since I broke it out if frustration when
I failed Assassin's Creed for the 25th time because the damned jump
button WOULD NOT respond to my violent repeated pressing...
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 4/5/2012 7:56 PM, Darren New wrote:
> Here's an interesting thought:
>
> There is no Turing machine capable of translating a Turing machine
> program into an input tape for a Universal Turing Machine.
>
Could you be more specific? There's multiple ways to interpret what you
mean and some of these interpretations are true while others are false.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On Fri, 06 Apr 2012 05:24:40 -0400, Warp wrote:
> Orchid Win7 v1 <voi### [at] devnull> wrote:
>> Turning machines only take tapes as input. To convert a Turning machine
>> into a tape, it would /already/ have to be a tape so it could be input.
>> :-P
>
> What's a turning machine?
A steering wheel.
Jim
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 4/6/2012 2:12, Orchid Win7 v1 wrote:
> On 06/04/2012 03:56 AM, Darren New wrote:
>> Here's an interesting thought:
>>
>> There is no Turing machine capable of translating a Turing machine
>> program into an input tape for a Universal Turing Machine.
>
> Turning machines only take tapes as input. To convert a Turning machine into
> a tape, it would /already/ have to be a tape so it could be input. :-P
Ding ding ding! Exactly. That's why real computers can do things that Turing
machines can't, for example. Turing machines can't calculate everything.
They can do calculations isomorphic to any calculation.
(Assuming you define "calculation" correctly.)
--
Darren New, San Diego CA, USA (PST)
"Oh no! We're out of code juice!"
"Don't panic. There's beans and filters
in the cabinet."
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
On 4/6/2012 8:14, Kevin Wampler wrote:
> On 4/5/2012 7:56 PM, Darren New wrote:
>> Here's an interesting thought:
>>
>> There is no Turing machine capable of translating a Turing machine
>> program into an input tape for a Universal Turing Machine.
>>
>
> Could you be more specific? There's multiple ways to interpret what you mean
> and some of these interpretations are true while others are false.
A turing machine program is a tuple, one element of which is a set of
tuples. Turing machines don't work with sets of tuples. I.e., exactly what
Andrew said.
--
Darren New, San Diego CA, USA (PST)
"Oh no! We're out of code juice!"
"Don't panic. There's beans and filters
in the cabinet."
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Darren New <dne### [at] sanrrcom> wrote:
> Turing machines can't calculate everything.
Are there (provably) solvable problems that cannot be calculated with a
Turing machine?
--
- Warp
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |