Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!news2.arglkargh.de!news.wiretrip.org!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.000 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'received:209.85.212.46': 0.03; 'received:mail-vw0-f46.google.com': 0.03; 'fine,': 0.07; 'infinite': 0.07; 'mode,': 0.07; 'pretend': 0.07; 'terry': 0.07; 'python': 0.07; 'correct.': 0.09; 'default)': 0.09; 'generators': 0.09; 'am,': 0.14; 'extension': 0.14; 'wrote:': 0.14; 'iterators,': 0.16; 'lambda': 0.16; 'reedy': 0.16; 'subject:versus': 0.16; 'summary,': 0.16; 'obviously': 0.20; 'tue,': 0.20; 'cc:no real name:2**0': 0.20; 'cc:2**0': 0.20; 'header:In-Reply-To:1': 0.22; 'cc:addr:python-list': 0.22; '(and': 0.22; 'reference.': 0.23; "didn't": 0.25; 'received:209.85.212': 0.25; 'says': 0.25; 'function': 0.27; 'message- id:@mail.gmail.com': 0.28; 'url:edu': 0.28; '(as': 0.29; 'mode': 0.29; 'universal': 0.29; 'operating': 0.30; 'least': 0.30; 'implement': 0.30; 'cc:addr:python.org': 0.31; 'finite': 0.31; 'thank': 0.32; 'etc)': 0.33; 'change': 0.34; 'describe': 0.35; 'subject:software': 0.35; 'machine': 0.37; 'received:209.85': 0.37; 'apr': 0.38; 'received:google.com': 0.38; 'but': 0.38; 'pretty': 0.38; 'authors': 0.39; 'machines': 0.39; 'received:209': 0.39; 'except': 0.39; 'header:Received:5': 0.40; '2011': 0.62; 'interest': 0.65; 'believe': 0.66; 'subject:Free': 0.72; 'papers': 0.74; '10:32': 0.91; 'calculus': 0.91 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:in-reply-to:references:date :message-id:subject:from:to:cc:content-type; bh=+lLbHqNlQaVjOQcvW1FVBIAc8cyHjlKr9b1qx4sAlYw=; b=sVUWIhsHwQSwyKCr2w226pn6QnvEU7VwTYjhD/6FawxNCA2UmxgJi1B3O1n7SyjvUA pFGE7QSBEJc3YOsVOOGbD9aL7uUPtf/z8yYq6yTg7huYmOR9xBTvD1RhBdfOrdFW7luy 5jmL02SNYa9wIZYHfHhfx1fWJ7W3+crCdkOaQ= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; b=ib+GStPxl6kAh4bHd1v2Sz1x1p8h/CdNY1o2izyzcVtHGL7Q3xIU3IDO/qCSCdYUqF IQePKgB+9BQq35WjW4/TH5XnISKqOzHqdhJ+qEtA2hDQpjuKKySJy5i4KB6EmY90S+q8 8WTuTqvNdFkx2jdgvxDflGm8Rz+o5Hp89kDlA= MIME-Version: 1.0 In-Reply-To: References: <4d9c5ca5$0$29991$c3e8da3$5496439d@news.astraweb.com> <87tyebf3r3.fsf_-_@benfinney.id.au> <_Abnp.8356$zn.729@newsfe19.iad> <4d9d6587$0$29992$c3e8da3$5496439d@news.astraweb.com> <__top.14604$zn.8052@newsfe19.iad> <8d9a097d-1160-4131-8bde-65e8e2ff3240@k5g2000yqj.googlegroups.com> Date: Tue, 12 Apr 2011 11:44:19 -0700 Subject: Re: Free software versus software idea patents From: Dan Stromberg To: Terry Reedy Content-Type: text/plain; charset=ISO-8859-1 Cc: python-list@python.org X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.12 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 25 NNTP-Posting-Host: 82.94.164.166 X-Trace: 1302633881 news.xs4all.nl 81485 [::ffff:82.94.164.166]:43928 X-Complaints-To: abuse@xs4all.nl Xref: x330-a1.tempe.blueboxinc.net comp.lang.python:3076 On Tue, Apr 12, 2011 at 10:32 AM, Terry Reedy wrote: > On 4/11/2011 4:36 AM, rusi wrote: > >> http://www.cse.uconn.edu/~dqg/papers/cie05.pdf >> >> may be of interest (and also other papers of Peter Wegner questioning >> the universality of Turing machines lambda calculus etc) > > Thank you for that reference. In summary, it says that while Turing machine > are universal for finite function calculations, infinite interactive > processes are not (finite) function calculations, and therefore need an > extension to TMs. This is pretty obviously correct. > > Python iterators, and especially generators, implement the extension that > the authors call 'persistent Turing machines' (PTMs, section 6.2), except > that iterators (and generators by default) operate in 'pull' mode, while > they describe PTMs as operating in 'push' mode (as with generator.send()). I didn't read the paper, but I believe Turing Machines are infinite. Interactive processes don't seem, at least to me, to change the applicability of Turing Machines - you merely pretend you have a bunch of squares preinitialized with your various inputs. If you have an infinite number of inputs, that's fine, you can have them with a preinitialized turing machine.