<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>BRAAIIINNSS &#187; COG366 Files</title>
	<atom:link href="http://www.johnfamilo.com/sounds-like/bit-matter/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johnfamilo.com</link>
	<description>Zombies know... Computers have intelligence, too!</description>
	<lastBuildDate>Thu, 15 Oct 2009 03:35:19 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>List Processing in Prolog</title>
		<link>http://www.johnfamilo.com/list-processing-in-prolog/</link>
		<comments>http://www.johnfamilo.com/list-processing-in-prolog/#comments</comments>
		<pubDate>Thu, 15 Oct 2009 03:35:19 +0000</pubDate>
		<dc:creator>john</dc:creator>
				<category><![CDATA[COG366 Files]]></category>

		<guid isPermaLink="false">http://www.johnfamilo.com/?p=47</guid>
		<description><![CDATA[Within the conceptual sphere of numbers between 0 and 9, we&#8217;ve explored Prolog by writing a few relatively useless predicates.
These predicates were required for the assignment:
rnprint(N) &#8211; writes N random numbers
rnlist(N,List) &#8211; creates a List with N random numbers
count(N,List,F) &#8211; returns F, the number of appearances of N in List
singleton_count(List,F) &#8211; returns F, the number [...]]]></description>
			<content:encoded><![CDATA[<p>Within the conceptual sphere of numbers between 0 and 9, we&#8217;ve explored Prolog by writing a few relatively useless predicates.</p>
<p>These predicates were required for the assignment:</p>
<blockquote><p>rnprint(N) &#8211; writes N random numbers<br />
rnlist(N,List) &#8211; creates a List with N random numbers<br />
count(N,List,F) &#8211; returns F, the number of appearances of N in List<br />
singleton_count(List,F) &#8211; returns F, the number of single-appearing numbers in List<br />
doubleton_count(List,F) &#8211; returns F, the number of twice-appearing numbers in List</p></blockquote>
<p>And then these predicates were weird useless things that I made up:</p>
<blockquote><p>rnexclusion(List,N) &#8211; returns N, a random number from 0 to 9 inclusive that is not a member of List<br />
rnsequence(List) &#8211; returns List, a list of 10 numbers from 0 to 9 inclusive in random order<br />
iota(N,List) &#8211; returns List, a list counting from 1 to N, or an empty list if N=0<br />
sum(N,List) &#8211; returns List, a list of elements with a sum equal to N<br />
removeAll(N,List,Out) &#8211; returns Out, the List with all elements N removed<br />
factors(N,List) &#8211; returns List, a list of all the factors of N</p></blockquote>
<p><a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/list/rnex.pro">code</a> &#8211; <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/list/rnex.demo">demo</a> &#8211; Enjoy.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.johnfamilo.com/list-processing-in-prolog/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Exhaustive Crypto Problem Solver</title>
		<link>http://www.johnfamilo.com/exhaustive-crypto-problem-solver/</link>
		<comments>http://www.johnfamilo.com/exhaustive-crypto-problem-solver/#comments</comments>
		<pubDate>Thu, 01 Oct 2009 05:44:28 +0000</pubDate>
		<dc:creator>john</dc:creator>
				<category><![CDATA[COG366 Files]]></category>

		<guid isPermaLink="false">http://www.johnfamilo.com/?p=28</guid>
		<description><![CDATA[An extension of the Crypto Puzzle Generator that is capable of solving problems up to order 5. This could easily be extended to much larger size puzzles, though the method is rather brute.
Part 1. demo - Experimenting with the provided combosets.pro code snippet.
Part 2. code &#8211; demo &#8211; Crypto problem solver capable of returning solutions to Crypto [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: left;">An extension of the Crypto Puzzle Generator that is capable of solving problems up to order 5. This could easily be extended to much larger size puzzles, though the method is rather brute.</p>
<p style="text-align: left;">Part 1. demo - Experimenting with the provided <a href="http://www.cs.oswego.edu/~blue/xex/black/courses/f09/cog366/combosets.pro">combosets.pro</a> code snippet.</p>
<p style="text-align: left;">Part 2. <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve1/crypto.pro">code</a> &#8211; <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve1/crypto.demo">demo</a> &#8211; Crypto problem solver capable of returning solutions to Crypto problems of orders 2, 3 and 4.</p>
<p style="text-align: left;">Part 3. <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve2/crypto.pro">code</a> &#8211; <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve2/crypto.demo">demo</a> &#8211; Extended Part 2 to solve up to order 5.</p>
<p style="text-align: left;">Part 4. <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve3/crypto.pro">code</a> &#8211; <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/xsolve3/crypto.demo">demo</a> &#8211; Extended Part 3 to generate Crypto problems and provide a solution.</p>
<blockquote>
<p style="text-align: left;"><em>File dependencies: <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/gen/gv.pro">gv.pro</a>, <a href="http://www.cs.oswego.edu/~blue/xex/black/courses/f09/cog366/combosets.pro">combosets.pro</a> by Craig Graci</em></p>
</blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.johnfamilo.com/exhaustive-crypto-problem-solver/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Crypto Puzzle Generator</title>
		<link>http://www.johnfamilo.com/crypto-puzzle-generator/</link>
		<comments>http://www.johnfamilo.com/crypto-puzzle-generator/#comments</comments>
		<pubDate>Thu, 01 Oct 2009 05:22:56 +0000</pubDate>
		<dc:creator>john</dc:creator>
				<category><![CDATA[COG366 Files]]></category>

		<guid isPermaLink="false">http://www.johnfamilo.com/?p=25</guid>
		<description><![CDATA[crypto.pro - an elementary Prolog script that generates a random Crypto problem. Crypto is a number puzzle where the objective is to obtain the Goal number by performing the basic mathematical operations on the provided array of numbers in any order. There is no guarantee of an answer to the generated problems, nor is there a [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: left;"><a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/gen/crypto.pro"><strong>crypto.pro</strong></a><strong> </strong>- an elementary Prolog script that generates a random Crypto problem. Crypto is a number puzzle where the objective is to obtain the Goal number by performing the basic mathematical operations on the provided array of numbers in any order. There is no guarantee of an answer to the generated problems, nor is there a limit of only one right answer.</p>
<blockquote>
<p style="text-align: left;"><em>File dependencies: <a href="http://moxie.oswego.edu/~jfamilo/cogsci3/prolog/gen/gv.pro">gv.pro</a> by Craig Graci</em></p>
</blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.johnfamilo.com/crypto-puzzle-generator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
