This is the second part of my posting on the Turing completeness of
Python's lambda expressions. This time I am going to define a recursive
function as a lambda expression (I use lambda when I am talking about
Python's lambda expressions, and λ for the theory – λ calculus.)
Now of course it is eas
Musical Notation writes:
> Is it possible to write a Turing-complete lambda function (which does
> not depend on named functions) in Python?
The wording of this question is questionable. Turing completeness is not
an attribute of a function, but of a system (for example a programming
language or
On Wed, Jul 31, 2013 at 11:55 PM, Steven D'Aprano
wrote:
> On Wed, 31 Jul 2013 13:53:26 +0700, Musical Notation wrote:
>
>> Is it possible to write a Turing-complete lambda function (which does
>> not depend on named functions) in Python?
>
>
> lambda s: eval(s)
eval is a named function.
--
http
On Wed, 31 Jul 2013 13:53:26 +0700, Musical Notation wrote:
> Is it possible to write a Turing-complete lambda function (which does
> not depend on named functions) in Python?
lambda s: eval(s)
--
Steven
--
http://mail.python.org/mailman/listinfo/python-list
On Wed, Jul 31, 2013 at 12:53 AM, Musical Notation
wrote:
> Is it possible to write a Turing-complete lambda function (which does not
> depend on named functions) in Python?
Yes, lambda functions are Turing-complete. You can get anonymous
recursion by defining the function to take a recursive f
On Wed 31 Jul 2013 08:53:26 AM CEST, Musical Notation wrote:
Is it possible to write a Turing-complete lambda function (which does not
depend on named functions) in Python?
what should a sinlge Turing-complete lambda function be?
For me, a programming language can be Turing-complete or a funct
Is it possible to write a Turing-complete lambda function (which does not
depend on named functions) in Python?
--
http://mail.python.org/mailman/listinfo/python-list
