<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/Computability"><title>BibSonomy bookmarks for /tag/Computability</title><link>https://www.bibsonomy.org/tag/Computability</link><description>BibSonomy RSS Feed for /tag/Computability</description><items><rdf:Seq><rdf:li rdf:resource="https://www.quantamagazine.org/a-short-guide-to-hard-problems-20180716/#"/><rdf:li rdf:resource="https://www.math.ias.edu/files/mathandcomp.pdf#page=1"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~odonnell/toolkit13/"/><rdf:li rdf:resource="http://www.sumofsquares.org/public/index.html"/><rdf:li rdf:resource="http://www.introtcs.org/public/index.html"/><rdf:li rdf:resource="http://arxiv.org/pdf/1505.01340.pdf"/><rdf:li rdf:resource="https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/463CD.pdf"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Computation_theory"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Millennium_Prize_Problems"/><rdf:li rdf:resource="https://en.wikipedia.org/wiki/Halting_problem"/><rdf:li rdf:resource="https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations"/><rdf:li rdf:resource="http://yovisto.blogspot.de/2012/08/its-computable-thanks-to-alonzo-church.html"/><rdf:li rdf:resource="http://www.perlmonks.org/?node_id=663393"/><rdf:li rdf:resource="http://theoinf.math.uni-siegen.de/while/debugger"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Investment_management"/></rdf:Seq></items></channel><item rdf:about="https://www.quantamagazine.org/a-short-guide-to-hard-problems-20180716/#"><title>A Short Guide to Hard Problems | Quanta Magazine</title><description></description><link>https://www.quantamagazine.org/a-short-guide-to-hard-problems-20180716/#</link><dc:creator>analyst</dc:creator><dc:date>2021-03-19T07:57:35+01:00</dc:date><dc:subject>article computability computer-science magazine problem </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-03-19T07:57:35+01:00&#034; href=&#034;https://www.quantamagazine.org/a-short-guide-to-hard-problems-20180716/#&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.quantamagazine.org/a-short-guide-to-hard-problems-20180716/#&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/magazine"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/problem"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.math.ias.edu/files/mathandcomp.pdf#page=1"><title>mathandcomp.pdf</title><description></description><link>https://www.math.ias.edu/files/mathandcomp.pdf#page=1</link><dc:creator>bshanks</dc:creator><dc:date>2018-03-18T06:03:39+01:00</dc:date><dc:subject>complexity computability cs cstheory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2018-03-18T06:03:39+01:00&#034; href=&#034;https://www.math.ias.edu/files/mathandcomp.pdf#page=1&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.math.ias.edu/files/mathandcomp.pdf#page=1&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cstheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~odonnell/toolkit13/"><title>15-859T: A Theorist&#039;s Toolkit 2013</title><description></description><link>http://www.cs.cmu.edu/~odonnell/toolkit13/</link><dc:creator>achakraborty</dc:creator><dc:date>2017-07-29T16:38:16+02:00</dc:date><dc:subject>algorithms computability computer-science graph-theory lectures linear-algebra slides </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-29T16:38:16+02:00&#034; href=&#034;http://www.cs.cmu.edu/~odonnell/toolkit13/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.cmu.edu/~odonnell/toolkit13/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph-theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lectures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linear-algebra"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/slides"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.sumofsquares.org/public/index.html"><title>Proofs, beliefs and algorithms through the lens of Sum of Squares</title><description></description><link>http://www.sumofsquares.org/public/index.html</link><dc:creator>achakraborty</dc:creator><dc:date>2017-07-29T16:10:06+02:00</dc:date><dc:subject>algorithms computability computer-science proof </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-29T16:10:06+02:00&#034; href=&#034;http://www.sumofsquares.org/public/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.sumofsquares.org/public/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.introtcs.org/public/index.html"><title>Introduction to Theoretical Computer Science</title><description></description><link>http://www.introtcs.org/public/index.html</link><dc:creator>achakraborty</dc:creator><dc:date>2017-07-29T15:31:27+02:00</dc:date><dc:subject>computability computer-science course </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-29T15:31:27+02:00&#034; href=&#034;http://www.introtcs.org/public/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.introtcs.org/public/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computer-science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/course"/></rdf:Bag></taxo:topics></item><item rdf:about="http://arxiv.org/pdf/1505.01340.pdf"><title>() - 1505.01340.pdf</title><description></description><link>http://arxiv.org/pdf/1505.01340.pdf</link><dc:creator>bshanks</dc:creator><dc:date>2016-12-12T10:00:07+01:00</dc:date><dc:subject>turing cs universal recursiontheory halting halt computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2016-12-12T10:00:07+01:00&#034; href=&#034;http://arxiv.org/pdf/1505.01340.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://arxiv.org/pdf/1505.01340.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/turing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursiontheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/halting"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/halt"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/463CD.pdf"><title>463CD.pdf</title><description></description><link>https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/463CD.pdf</link><dc:creator>bshanks</dc:creator><dc:date>2016-12-12T10:00:07+01:00</dc:date><dc:subject>turing cs universal recursiontheory halting halt computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2016-12-12T10:00:07+01:00&#034; href=&#034;https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/463CD.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/463CD.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/turing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/universal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursiontheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/halting"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/halt"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Computation_theory"><title>Theory of computation - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Computation_theory</link><dc:creator>pauljrichardson</dc:creator><dc:date>2015-04-05T03:32:08+02:00</dc:date><dc:subject>Bookmarks_bar MISC Philosophy Computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-04-05T03:32:08+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Computation_theory&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Computation_theory&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks_bar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MISC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Millennium_Prize_Problems"><title>Millennium Prize Problems - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Millennium_Prize_Problems</link><dc:creator>pauljrichardson</dc:creator><dc:date>2015-04-05T03:32:08+02:00</dc:date><dc:subject>Bookmarks_bar MISC Philosophy Computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-04-05T03:32:08+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Millennium_Prize_Problems&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Millennium_Prize_Problems&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks_bar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MISC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability"/></rdf:Bag></taxo:topics></item><item rdf:about="https://en.wikipedia.org/wiki/Halting_problem"><title>Halting problem - Wikipedia, the free encyclopedia</title><description></description><link>https://en.wikipedia.org/wiki/Halting_problem</link><dc:creator>pauljrichardson</dc:creator><dc:date>2015-04-05T03:32:08+02:00</dc:date><dc:subject>Bookmarks_bar MISC Philosophy Computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-04-05T03:32:08+02:00&#034; href=&#034;https://en.wikipedia.org/wiki/Halting_problem&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://en.wikipedia.org/wiki/Halting_problem&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks_bar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MISC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability"/></rdf:Bag></taxo:topics></item><item rdf:about="https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations"><title>Computational complexity of mathematical operations - Wikipedia, the free encyclopedia</title><description></description><link>https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations</link><dc:creator>pauljrichardson</dc:creator><dc:date>2015-04-05T03:32:08+02:00</dc:date><dc:subject>Bookmarks_bar MISC Philosophy Computability </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-04-05T03:32:08+02:00&#034; href=&#034;https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bookmarks_bar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MISC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability"/></rdf:Bag></taxo:topics></item><item rdf:about="http://yovisto.blogspot.de/2012/08/its-computable-thanks-to-alonzo-church.html"><title>It&#039;s Computable - thanks to Alonzo Church</title><description>You know, the fact that you can read your email on a cell phone as well as on your desktop computer or almost any other computer connected to the internet, in principle is possible thanks to mathematician Alonzo Church, who gave the proof (together with Alan Turing) that everything that is computable on the simple model of a Turing Machine, also is computable with any other &#039;computer model&#039;.</description><link>http://yovisto.blogspot.de/2012/08/its-computable-thanks-to-alonzo-church.html</link><dc:creator>lysander07</dc:creator><dc:date>2012-08-11T17:19:00+02:00</dc:date><dc:subject>2012 Entscheidungsproblem computability computerscience mathematics yovisto </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;You know, the fact that you can read your email on a cell phone as well as on your desktop computer or almost any other computer connected to the internet, in principle is possible thanks to mathematician Alonzo Church, who gave the proof (together with Alan Turing) that everything that is computable on the simple model of a Turing Machine, also is computable with any other &amp;#039;computer model&amp;#039;.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2012"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Entscheidungsproblem"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computerscience"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mathematics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/yovisto"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.perlmonks.org/?node_id=663393"><title>Perl Cannot Be Parsed: A Formal Proof</title><description></description><link>http://www.perlmonks.org/?node_id=663393</link><dc:creator>brightbyte</dc:creator><dc:date>2009-08-21T17:58:04+02:00</dc:date><dc:subject>computability computing hackers o_O perl theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-08-21T17:58:04+02:00&#034; href=&#034;http://www.perlmonks.org/?node_id=663393&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.perlmonks.org/?node_id=663393&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hackers"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/o_O"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/perl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://theoinf.math.uni-siegen.de/while/debugger"><title>Simple Debugger for WHILE</title><description>A simple step-by-step debugger for the WHILE-language as described in the book &#034;Computability and Complexity from a Programming Perspective&#034; by Neil Jones</description><link>http://theoinf.math.uni-siegen.de/while/debugger</link><dc:creator>folke</dc:creator><dc:date>2008-09-21T20:42:54+02:00</dc:date><dc:subject>complexity computability while </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;A simple step-by-step debugger for the WHILE-language as described in the book &amp;#034;Computability and Complexity from a Programming Perspective&amp;#034; by Neil Jones&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/while"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Investment_management"><title>Investment management - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Investment_management</link><dc:creator>semanticinvesting</dc:creator><dc:date>2007-10-13T19:01:22+02:00</dc:date><dc:subject>Cognitive-Architectures Cognitive-Hierarchies Complexity Computability Computability-Theory Decidability Deciding Decision-Models Decision-Procedures Decision-Theory Evolution-Theory ExtendAbility HyperComputability Intelligence-Order-Relations Intentionality Interactivity Investing-strategies-Space Investment-Decisions Investment-Management NeuroScience Optimality ParaConsistency Policies Populations-of-Strategies Portfolio-Management Portfolio-Selection Portfolios Selecting Self-Reflectivity Steering Survivability category-of-strategies investing-strategies </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-10-13T19:01:22+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Investment_management&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Investment_management&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cognitive-Architectures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cognitive-Hierarchies"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Computability-Theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Decidability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Deciding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Decision-Models"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Decision-Procedures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Decision-Theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evolution-Theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ExtendAbility"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/HyperComputability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Intelligence-Order-Relations"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Intentionality"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Interactivity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Investing-strategies-Space"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Investment-Decisions"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Investment-Management"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/NeuroScience"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Optimality"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ParaConsistency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Policies"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Populations-of-Strategies"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Portfolio-Management"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Portfolio-Selection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Portfolios"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Selecting"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Self-Reflectivity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Steering"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Survivability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/category-of-strategies"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/investing-strategies"/></rdf:Bag></taxo:topics></item></rdf:RDF>