<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: The Limits Of Computer Software Algorithms That Are Implementing Strong Artificial Intelligences</title>
	<atom:link href="http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/feed/" rel="self" type="application/rss+xml" />
	<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/</link>
	<description>.ידע הוא כוח</description>
	<lastBuildDate>Fri, 23 Oct 2009 01:45:09 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Dkny</title>
		<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/#comment-23</link>
		<dc:creator>Dkny</dc:creator>
		<pubDate>Fri, 28 Aug 2009 10:18:25 +0000</pubDate>
		<guid isPermaLink="false">http://0x522d47.wordpress.com/?p=53#comment-23</guid>
		<description>Exactly. More specific, computational complexity theory and general computational theory in computer science.

However, as you have written, the first, basic question is what problem we are actually trying to solve (the issue of defining strong artificial intelligence). As you may saw in this or maybe recent articles is, that I’m also pointing out the question if the current hardware concepts for problem solving are enough for this range of complexity. The current aspect (digital computers) is, as you have written, the prove provided by a Turing machine. But the prove concept counts for known analog and digital computers. The question is, are digital computers really enough? We know concepts of molecular (also more specific deoxyribonucleic acid) and quantum computer hardware that could bring us to the solution. The quantum computer programming language limits in this case are defined with a quantum Turing machine, and so on.

Thank you for your objective comment.;. All the best!!</description>
		<content:encoded><![CDATA[<p>Exactly. More specific, computational complexity theory and general computational theory in computer science.</p>
<p>However, as you have written, the first, basic question is what problem we are actually trying to solve (the issue of defining strong artificial intelligence). As you may saw in this or maybe recent articles is, that I’m also pointing out the question if the current hardware concepts for problem solving are enough for this range of complexity. The current aspect (digital computers) is, as you have written, the prove provided by a Turing machine. But the prove concept counts for known analog and digital computers. The question is, are digital computers really enough? We know concepts of molecular (also more specific deoxyribonucleic acid) and quantum computer hardware that could bring us to the solution. The quantum computer programming language limits in this case are defined with a quantum Turing machine, and so on.</p>
<p>Thank you for your objective comment.;. All the best!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alex</title>
		<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/#comment-18</link>
		<dc:creator>Alex</dc:creator>
		<pubDate>Fri, 03 Oct 2008 19:06:39 +0000</pubDate>
		<guid isPermaLink="false">http://0x522d47.wordpress.com/?p=53#comment-18</guid>
		<description>Thanks for the information. Added you to bookmark))
Your new reader.</description>
		<content:encoded><![CDATA[<p>Thanks for the information. Added you to bookmark))<br />
Your new reader.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: KingTrast</title>
		<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/#comment-17</link>
		<dc:creator>KingTrast</dc:creator>
		<pubDate>Thu, 25 Sep 2008 15:44:05 +0000</pubDate>
		<guid isPermaLink="false">http://0x522d47.wordpress.com/?p=53#comment-17</guid>
		<description>Thanks for the information. Your blog is added to your bookmarks. Develop. 
Your reader.</description>
		<content:encoded><![CDATA[<p>Thanks for the information. Your blog is added to your bookmarks. Develop.<br />
Your reader.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: R-G</title>
		<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/#comment-14</link>
		<dc:creator>R-G</dc:creator>
		<pubDate>Wed, 27 Aug 2008 18:28:56 +0000</pubDate>
		<guid isPermaLink="false">http://0x522d47.wordpress.com/?p=53#comment-14</guid>
		<description>Exactly. More specific, computational complexity theory and general computational theory in computer science.

However, as you have written, the first, basic question is what problem we are actually trying to solve (the issue of defining strong artificial intelligence). As you may saw in this or maybe recent articles is, that I’m also pointing out the question if the current hardware concepts for problem solving are enough for this range of complexity. The current aspect (digital computers) is, as you have written, the prove provided by a Turing machine. But the prove concept counts for known analog and digital computers. The question is, are digital computers really enough? We know concepts of molecular (also more specific deoxyribonucleic acid) and quantum computer hardware that could bring us to the solution. The quantum computer programming language limits in this case are defined with a quantum Turing machine, and so on.

Thank you for your objective comment.</description>
		<content:encoded><![CDATA[<p>Exactly. More specific, computational complexity theory and general computational theory in computer science.</p>
<p>However, as you have written, the first, basic question is what problem we are actually trying to solve (the issue of defining strong artificial intelligence). As you may saw in this or maybe recent articles is, that I’m also pointing out the question if the current hardware concepts for problem solving are enough for this range of complexity. The current aspect (digital computers) is, as you have written, the prove provided by a Turing machine. But the prove concept counts for known analog and digital computers. The question is, are digital computers really enough? We know concepts of molecular (also more specific deoxyribonucleic acid) and quantum computer hardware that could bring us to the solution. The quantum computer programming language limits in this case are defined with a quantum Turing machine, and so on.</p>
<p>Thank you for your objective comment.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: rjprins</title>
		<link>http://0x522d47.wordpress.com/2008/08/22/the-limits-of-computer-software-algorithms-that-are-implementing-strong-artificial-intelligences/#comment-11</link>
		<dc:creator>rjprins</dc:creator>
		<pubDate>Wed, 27 Aug 2008 16:18:52 +0000</pubDate>
		<guid isPermaLink="false">http://0x522d47.wordpress.com/?p=53#comment-11</guid>
		<description>I suggest you look into to computational theory. That discipline is concerned with what problems can and can not be solved and what kinds of (theoretical) computer are necessary to solve them.

The most capable, reasonable computer is the Turing Machine. All programming languages you just named are practically equivalent to this machine. If you can show a Turing Machine can not solve the problem of strong AI, then it is also impossible with any real programming language.

Of course the problem of strong AI is currently the problem of defining strong AI.</description>
		<content:encoded><![CDATA[<p>I suggest you look into to computational theory. That discipline is concerned with what problems can and can not be solved and what kinds of (theoretical) computer are necessary to solve them.</p>
<p>The most capable, reasonable computer is the Turing Machine. All programming languages you just named are practically equivalent to this machine. If you can show a Turing Machine can not solve the problem of strong AI, then it is also impossible with any real programming language.</p>
<p>Of course the problem of strong AI is currently the problem of defining strong AI.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
