On 02/07/07, Eugen Leitl <[EMAIL PROTECTED]> wrote:

> But in the final analysis, the AI would be able to be implemented as
> code in a general purpose language on a general purpose computer with

Absolutely not. Possibly, something like a silicon compiler
with billions to trillions asynchronous systems. Certainly not
your grandfather's computer.

> sufficient storage. Any lack in efficiency of such an approach would
> eventually be overcome by brute force increase in processing speed.

No, there are physical limits. You have to go asynchronous OOP, and
fine-grained sea of gates. Even current approaches are 3d torus of nodes
of microkernel OS, soon with FPGAs & Co.

But in the end, the AI will be Turing emulable, which means you can
run it on a general purpose computer with sufficient memory.



--
Stathis Papaioannou

-----
This list is sponsored by AGIRI: http://www.agiri.org/email
To unsubscribe or change your options, please go to:
http://v2.listbox.com/member/?member_id=4007604&user_secret=7d7fb4d8

Reply via email to