Hello there, Germano D'Abramo has joined our group, he is the author of the paper with information theoretic arguments that seem to rule out the possibility of...
... Also of interest is this news item on cognews.com: http://cognews.com/1088453031/index_html The researchers have identified activity in the right...
Eray, Forgive my ignorance, Please provide the relatively basic tent-poll issues of a "mathematical argument that runs counter to AI." Further, I do not...
... a "mathematical argument that runs counter to AI." Further, I do not understand the logic of running counter (in the opposite direction?) to the end goal...
[some more thoughts on elegant languages] On Tuesday 18 May 2004 13:29, Eray Ozkural wrote: ... Forget my above approximation for a moment, since there are...
More comments on why Raatikainen's criticism of Chaitin is fundamentally wrong. ... Subject: Re: Raatikainen's Complexity Complex Date: Thursday 15 July 2004...
Jisperanza enlightens us about elegant languages with his ever interesting quotes. ... Subject: Re: [analytic] Elegant languages Date: Wednesday 14 July 2004...
... Terseness was something that I tried to formalize in a previous post, using average compressed length (Kolmogorov complexity) with respect to a specific ...
... [...snip...] ... length of ... all ... definition ... the ... Interesting. How would a generator+AI tell that sentences of plain good old logic (say:...
... It would not be easy. It would require the AI to know a good deal about human culture, and the present context, make reliable inferences from this ...
I saw this news item on slashdot, interesting application. Once IBM was using an expert system for memory management (in OS/400 IIRC). Who knows, perhaps with...
Hello there, On sci.physics.discrete, I was given some valuable information about the new concept of amorphous computing. I think this will be of interest to...
Hello Members, I'm a third year philosophy student at UC Davis and this place is right up my alley; Lots of interesting stuff and a great inside track on...
... Hello Jack, it's nice to see people genuinely interested in philosophy of mind. First, I will recommend you the excellent introductory book by Tim Crane: ...
A draft of this is available online at: http://www.wolfson.ox.ac.uk/~floridi/readings/foundations%20of% 20computing.pdf Modestly titled, "Foundations of...
... I kind of agree with this point of view, but I think I wildly disagree with both Smith and Sloman on the issue (it would certainly be splendid to hear ...
Hi everyone, I have been a silent observer of this group for a while, but not really had the time (or the background) to contribute to the discussion so far....
While the Turing machine is not a good practical model for many problem types it is most certainly a general theoretical model of computing. The implication...
I should have mentioned that in my view the object model is a complete and simple model of computation that makes the issue of methodology mute. It have two...
... I disagree with this entirely. I say that computation is about how we can build nice, little machines that can be filled with bits, cranked, and somehow ...
... Outstanding! Five year ago, ... well, I guess I was early to the vague idea that the underlying process of computation needed reexamination, but somewhat...
Josh, you wrote, ... Turing Machines have -by definition- infinite tapes and thus (so far as I am aware) are impossible to implement, unlike Buicks. ... I find...
... This is a common and pernicious misinterpretation of Turing's work. It is my view that Turing needs to be better understood. If Smith and Sloman agree...
... Buicks use an indeterminant amount of gas, just as any problem can only use a finite finite tape in finite time. You can in principle add tape as needed...
... The instantaneous description (ID) of a TM is finite at all times. The "infinite" part of the tape has constant algorithmic complexity (it is all blank...