}} 
    }
  });
</script>

<script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>

<div id="hiddden">

This exercise concerns the expressiveness of
decision lists (Section <a class="sectionRef" title="" href="#">learning-theory-section</a>).<br />

1.  Show that decision lists can represent any Boolean function, if the
    size of the tests is not limited.<br />

2.  Show that if the tests can contain at most $k$ literals