Thank you for a quick answer! I'll take a look at it, my curiosity approves additional items on my TODO list :-)
Best, mirek > The classical universal > dovetailer generates easily all the quantum computations, but I find > hard to just define *one* unitary transformation, without measurement, > capable of generating forever greater computational memory space. Other > problems are more technical, and are related to the very notion of > universality and are rather well discussed in the 2007 paper: > > Deutsch's Universal Quantum Turing Machine revisited. > http://arxiv.org/pdf/quant-ph/0701108v1 > > I could relate this with technical problem with the BCI combinator > algebra, that is those structure in which every process are reversible, > and no cloning are possible (cf the No Kestrel, No Starling summary of > physics(*)). Those algebra are easily shown being non turing universal, > and pure unitarity seems to me to lead to such algebra. > > Could you implement with a quantum computer the "really infinite" > counting algorithm by a purely unitary transformation? The one which > generates without stopping 0, 1, 2, 3, ... That would already be a big help. > > Bruno > > (*) Marchal B., 2005, Theoretical computer science and the natural > sciences > <http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75DC-4GX6J45-1&_user=532047&_coverDate=12%2F31%2F2005&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000026678&_version=1&_urlVersion=0&_userid=532047&md5=e087a268f1a31acd7cd9ef629e6dc543>, > Physics of Life Reviews, Vol. 2 Issue 4 December 2005, pp. 251-289. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/everything-list?hl=en -~----------~----~----~----~------~----~------~--~---
