Step 1
Show that $$0<x_n \leq 3\tag1$$ for $n=1,2,\cdots.$
Proof
Obviously, $(1)$ holds for $n=1$. Assume that $(1)$ holds for $n=k$, namely, $0<x_k \leq 3$, then $$0<\frac{1}{4}<x_{k+1}=\frac{1}{4-x_k} \leq 1 \leq 3,$$which implies $(1)$ also holds for $n=k+1$. Thus, by mathematical induction, $(1)$ holds for all $n=1,2,\cdots.$
Step 2
Show that $$x_{n+1}<x_n\tag2$$ for $n=1,2,\cdots.$
Proof
Notice that $x_1=3, x_2=1.$ Hence $x_2<x_1,$ which implies that $(2)$ holds for $n=1$. Assume that $(2)$ holds for $n=k$, namely, $x_{k+1}<x_k$, then $$x_{k+2}=\frac{1}{4-x_{k+1}}<\frac{1}{4-x_{k}}=x_{k+1},$$which implies $(2)$ also holds for $n=k+1$. Thus, by mathematical induction, $(2)$ holds for all $n=1,2,\cdots.$
Combining the two steps, by monotone convergence theorem, we may claim $x_n$ has a limit, which could be denoted as $x.$ Thus, taking the simultaneous limits of both sides of the recursion formula, we have$$x=\frac{1}{4-x}.$$Hence, $x=2 \pm \sqrt{3}.$ But $x_n \leq 3$, hence $x \leq 3,$ which implies that $2+\sqrt{3}>3$ does not satisfy the requirement. As a result, $$x=2-\sqrt{3},$$ which is desired limit.