On Thu, Feb 28, 2008 at 3:20 PM, William Pearson <[EMAIL PROTECTED]> wrote: > On 28/02/2008, YKY (Yan King Yin) <[EMAIL PROTECTED]> wrote: > > > > Generally programmable, yes. But that's very broad. Many systems have > this > > property. > > Note I want something different than computational universality. E.g. > Von Neumann architectures are generally programmable, Harvard > architectures aren't. As they can't be reprogrammed at run time. > > http://en.wikipedia.org/wiki/Harvard_architecture >
I agree with YKY, it's not a very useful specification. Turing machine is not necessarily a way either. I think that ability to learn structure-less production rules is sufficient. These allow system to implement finite state machines internally, and these state machines operate on data streams consisting of external I/O and states of other state machines. This organizational principle follows naturally from blackboard-like system where most of the facts on the blackboard are labels given to statistical regularities detected in previous moments. -- Vladimir Nesov [EMAIL PROTECTED] ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=95818715-a78a9b Powered by Listbox: http://www.listbox.com
