<?xml version="1.0" encoding="utf-8" ?> <rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"> <channel> <title> <![CDATA[ Search for 'su:&quot;Recursion theory&quot;']]> </title> <link> https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Recursion%20theory%22&#38;sort_by=title_dsc&#38;format=rss </link> <atom:link rel="self" type="application/rss+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Recursion%20theory%22&#38;sort_by=title_dsc&#38;format=rss"/> <description> <![CDATA[ Search results for 'su:&quot;Recursion theory&quot;' at ]]> </description> <opensearch:totalResults>3</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>30</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Recursion%20theory%22&#38;sort_by=title_dsc&#38;format=opensearchdescription"/> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dsu%253A%2522Recursion%2520theory%2522" startPage="" /> <item> <title> How to think about algorithms / </title> <dc:identifier>ISBN:9780521849319 | 0521849314</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=50965</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0521849314.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Edmonds, Jeff..<br /> Cambridge ; | New York : Cambridge University Press, 2008 .<br /> xiii, 448 p. : , Includes index 25 cm..<br /> 9780521849319 | 0521849314 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=50965">Place hold on <em>How to think about algorithms /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=50965</guid> </item> <item> <title> Fundamentals of mathematical logic / </title> <dc:identifier>ISBN:1568812620</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36952</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/1568812620.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Hinman, Peter G..<br /> Wellesley, MA : A K Peters, 2005 .<br /> xvi, 878 p. ; 24 cm..<br /> 1568812620 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=36952">Place hold on <em>Fundamentals of mathematical logic /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=36952</guid> </item> <item> <title> Computability theory : an introduction to recursion theory / </title> <dc:identifier>ISBN:9780123849588</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=67094</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0123849586.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Enderton, Herbert B..<br /> Boston, MA : Academic Press, 2011 .<br /> 174 p. : 24 cm..<br /> 9780123849588 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=67094">Place hold on <em>Computability theory :</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=67094</guid> </item> </channel> </rss>
