[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
**Subject**: **Re: __bshr vs __bshl**
**From**: Coda Highland <chighland@...>
**Date**: Mon, 9 Apr 2018 12:32:34 -0500

On Mon, Apr 9, 2018 at 12:19 PM, Francisco Olarte
<folarte@peoplecall.com> wrote:
> On Mon, Apr 9, 2018 at 3:08 PM, Dirk Laurie <dirk.laurie@gmail.com> wrote:
> ...
>> In fact, why have Lua at all since a Turing machine can do everything?
>
> Because you cannot implement a Turing Machine in a normal computer?
>
> Francisco Olarte.
You can implement a sufficiently large finite approximation of a Turing Machine.
On the other hand, a Turing Machine (even a finite one) is a
ridiculously inefficient beast, and you can't implement a Turing
Machine optimizer in a Turing Machine. (You CAN implement one that
optimizes for the capabilities of a given hardware implementation, but
you by definition cannot make a Turing Machine whose purpose is to
make another Turing Machine that is capable of violating the rules of
a Turing Machine.) So where the rubber meets the road, you're gonna
need a programming language that isn't a Turing Machine. :P
/s/ Adam