On Thursday, November 1, 2018 at 5:47:09 PM UTC, John Clark wrote:
>
> On Thu, Nov 1, 2018 at 8:18 AM > wrote:
>
> *> motion can't be done in finite steps*
>
>
> It can if Spacetime is granular,
>
*It is unethical to truncate my comment in an attempt to win an argument.
Of course motion can
On Thursday, November 1, 2018 at 6:15:50 PM UTC-5, Brent wrote:
>
>
>
> On 11/1/2018 4:02 PM, Philip Thrift wrote:
>
>
>
> On Thursday, November 1, 2018 at 4:02:56 PM UTC-5, Brent wrote:
>>
>>
>>
>> On 11/1/2018 11:59 AM, Philip Thrift wrote:
>>
>>
>>
>> On Thursday, November 1, 2018 at 1:44:19
On Monday, October 15, 2018 at 9:40:39 PM UTC+11, agrays...@gmail.com wrote:
>
>
>
> On Sunday, October 14, 2018 at 5:08:42 PM UTC, smitra wrote:
>>
>> On 14-10-2018 15:24, agrays...@gmail.com wrote:
>> > In a two state system, such as a qubit, what forces the interpretation
>> > that the syste
On 11/1/2018 4:02 PM, Philip Thrift wrote:
On Thursday, November 1, 2018 at 4:02:56 PM UTC-5, Brent wrote:
On 11/1/2018 11:59 AM, Philip Thrift wrote:
On Thursday, November 1, 2018 at 1:44:19 PM UTC-5, John Clark wrote:
On Thu, Nov 1, 2018 at 2:27 PM Philip Thrift
On Thursday, November 1, 2018 at 4:02:56 PM UTC-5, Brent wrote:
>
>
>
> On 11/1/2018 11:59 AM, Philip Thrift wrote:
>
>
>
> On Thursday, November 1, 2018 at 1:44:19 PM UTC-5, John Clark wrote:
>>
>>
>> On Thu, Nov 1, 2018 at 2:27 PM Philip Thrift wrote:
>>
>> *> infinite time Turing machines ar
On 11/1/2018 11:59 AM, Philip Thrift wrote:
On Thursday, November 1, 2018 at 1:44:19 PM UTC-5, John Clark wrote:
On Thu, Nov 1, 2018 at 2:27 PM Philip Thrift > wrote:
/> infinite time Turing machines are more powerful than
ordinary Turing machines/
That is true, i
On Thursday, November 1, 2018 at 2:33:31 PM UTC-5, John Clark wrote:
>
> On Thu, Nov 1, 2018 at 3:11 PM Philip Thrift > wrote:
>
> > How does *the arrow shot at a target *(in Zeno's Paradox) *compute* the
>> truth of the forall-exists quantifier construct in the Caucy definition?
>>
>
> I know
On Thu, Nov 1, 2018 at 3:11 PM Philip Thrift wrote:
> How does *the arrow shot at a target *(in Zeno's Paradox) *compute* the
> truth of the forall-exists quantifier construct in the Caucy definition?
>
I know how calculus computes it, I don't know for a fact the arrow computes
it the same way b
On Thursday, November 1, 2018 at 1:48:16 PM UTC-5, John Clark wrote:
>
> On Thu, Nov 1, 2018 at 2:43 PM Philip Thrift > wrote:
>
> *> Even if spacetime is "continuous", what motion is in reality is not
>> resolved by a Cauchy-type of (ε, δ)-definition of limit*
>>
>
> Why not?
>
> John K Clark
On Thursday, November 1, 2018 at 1:44:19 PM UTC-5, John Clark wrote:
>
>
> On Thu, Nov 1, 2018 at 2:27 PM Philip Thrift > wrote:
>
> *> infinite time Turing machines are more powerful than ordinary Turing
>> machines*
>
>
> That is true, it is also true that if dragons existed they would be
>
On Thu, Nov 1, 2018 at 2:43 PM Philip Thrift wrote:
*> Even if spacetime is "continuous", what motion is in reality is not
> resolved by a Cauchy-type of (ε, δ)-definition of limit*
>
Why not?
John K Clark
--
You received this message because you are subscribed to the Google Groups
"Everythi
On Thu, Nov 1, 2018 at 2:27 PM Philip Thrift wrote:
*> infinite time Turing machines are more powerful than ordinary Turing
> machines*
That is true, it is also true that if dragons existed they would be
dangerous and if I had some cream I could have strawberries and cream, if I
had some strawb
On Thursday, November 1, 2018 at 12:47:09 PM UTC-5, John Clark wrote:
>
> On Thu, Nov 1, 2018 at 8:18 AM > wrote:
>
> *> motion can't be done in finite steps*
>
>
> It can if Spacetime is granular, and even if it's not and Spacetime is
> continuous motion is still possible and Calculus tells us
On Thursday, November 1, 2018 at 12:31:13 PM UTC-5, John Clark wrote:
>
> On Wed, Oct 31, 2018 at 3:14 PM Philip Thrift > wrote:
>
> From https://www.cs.auckland.ac.nz/~cristian/talks/selected/BeamerATM.pdf
>>
>> *> An accelerated Turing machine (sometimes called Zeno machine) is a
>> Turing m
> On 31 Oct 2018, at 13:47, Philip Thrift wrote:
>
>
> Bruno,
>
> Have you looked at various SKI interpreters around that could be used?
> Several now (on GitHub) in JavaScript. Also in Haskell. And there's the
> Unlambda system by David Madore.
A long time ago, I have programmed in LISP a
On Thu, Nov 1, 2018 at 8:18 AM wrote:
*> motion can't be done in finite steps*
It can if Spacetime is granular, and even if it's not and Spacetime is
continuous motion is still possible and Calculus tells us how. But Zeno can
not tell us which of these explanations is correct and so joins the r
On Wed, Oct 31, 2018 at 3:14 PM Philip Thrift wrote:
>From https://www.cs.auckland.ac.nz/~cristian/talks/selected/BeamerATM.pdf
>
> *> An accelerated Turing machine (sometimes called Zeno machine) is a
> Turing machine that takes 2^−n units of time (say seconds) to perform its
> nth step; we ass
On Thursday, November 1, 2018 at 2:09:41 PM UTC+1, agrays...@gmail.com
wrote:
>
>
>
> On Wednesday, October 31, 2018 at 3:38:55 PM UTC, John Clark wrote:
>>
>> On Tue, Oct 30, 2018 at 10:16 PM wrote:
>>
>> >>What you described is a infinite number of FIXED length discrete
steps, and if t
On Wednesday, October 31, 2018 at 3:38:55 PM UTC, John Clark wrote:
>
> On Tue, Oct 30, 2018 at 10:16 PM >
> wrote:
>
> >>What you described is a infinite number of FIXED length discrete
>>> steps, and if that is what motion is motion would indeed be impossible, but
>>> its not the infinity t
On Wednesday, October 31, 2018 at 3:38:55 PM UTC, John Clark wrote:
>
> On Tue, Oct 30, 2018 at 10:16 PM >
> wrote:
>
> >>What you described is a infinite number of FIXED length discrete
>>> steps, and if that is what motion is motion would indeed be impossible, but
>>> its not the infinity t
20 matches
Mail list logo
