<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: tylerroost</title>
    <description>The latest articles on DEV Community by tylerroost (@tylerroost).</description>
    <link>https://dev.to/tylerroost</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F815377%2F1184eaee-b36c-4dcb-a089-41ab62578cba.jpeg</url>
      <title>DEV Community: tylerroost</title>
      <link>https://dev.to/tylerroost</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/tylerroost"/>
    <language>en</language>
    <item>
      <title>This but for medical</title>
      <dc:creator>tylerroost</dc:creator>
      <pubDate>Sun, 20 Feb 2022 16:30:42 +0000</pubDate>
      <link>https://dev.to/tylerroost/this-but-for-medical-1gjb</link>
      <guid>https://dev.to/tylerroost/this-but-for-medical-1gjb</guid>
      <description></description>
    </item>
    <item>
      <title>I thought i had posted already </title>
      <dc:creator>tylerroost</dc:creator>
      <pubDate>Sun, 20 Feb 2022 15:21:10 +0000</pubDate>
      <link>https://dev.to/tylerroost/i-thought-i-had-posted-already-2cbm</link>
      <guid>https://dev.to/tylerroost/i-thought-i-had-posted-already-2cbm</guid>
      <description>&lt;p&gt;Acronym trees. How do they work as hashes and as not hashes but hierarchies most like hidden Markov probabilities? But also not. Looking for a lively discussion when I can return soon I gotta work out to free my mind on this subject. Also Monte Carlo infallibility what's that about? How are the two related and why or why not and/or both?&lt;/p&gt;

</description>
      <category>discuss</category>
    </item>
  </channel>
</rss>
