title: understanding referential transparency
body: <p>Generally, I have a headache because something is wrong with my reasoning:</p>
  
  <ol>
  <li><p>For 1 set of arguments, referential transparent function will always return 1 set of output values.</p></li>
  <li><p>that means that such function could be represented as a truth table (a table where 1 set of output parameters is specified for 1 set of arguments).</p></li>
  <li><p>that makes the logic behind such functions <em>is</em> combinational (as opposed to sequential)</p></li>
  <li><p>that means that with pure functional language (that has only rt functions) it is possible to describe only combinational logic.</p></li>
  </ol>
  
  <p>The last statement is derived from this reasoning, <em>but</em> it's obviously false; that means there is an error in reasoning. <strong>[question: where is error in this reasoning?]</strong></p>
  
  <p>UPD2. You, guys, are saying lots of interesting stuff, but not answering my question. I defined it more explicitly now. Sorry for messing up with question definition!</p>