We can use that AM-GM inequality to prove that for every $n \in \mathbb{N}$:
$$
a_{n+1} = \frac{1}{2}(a_{n}+\frac{\sigma}{a_{n}}) \geq \sqrt\sigma
$$
So the sequence is limited below. Notice that, if $a_{1}=\sqrt\sigma$, then the whole sequence would be constant and equal to $\sqrt\sigma$, which means that it would be convergent to $\sqrt\sigma$. Assume, then that $a_{1}>\sqrt\sigma$. We first note that $a_{n}>\sqrt\sigma$ for $n\geq2$ (you can prove this using induction, it's very simple).
We affirm that this sequence is monotonically decreasing. We have, using the fact that $a_{n}>\sqrt\sigma$,
$$
a_{n+1}=\frac{a_{n}}{2}+\frac{\sigma}{2a_{n}} <\frac{a_{n}}{2} + \frac{a^{2}_{n}}{2a_{n}} = a_{n}
$$
So, the sequence is monotonically decreasing and it's limited below, which means that it is convergent. Since now you know the limit exists, you can just apply the limit on both sides of the equation that defines the sequence to find it (let $\lim a_{n+1}=\lim a_{n}=a$):
$$
\lim a_{n+1} = \frac{1}{2}(\lim a_{n}+\frac{\sigma}{\lim a_{n}}) \to a = \frac{1}{2}(a+\frac{\sigma}{a}) \to a = \lim a_{n} = \sqrt\sigma
$$
So, the limit is $\sqrt\sigma$ for every possible value of $a_{1}$. The operations used (sum of limits = limit of sums, constants out and division) to find the limit are all justified because we know that the limit exists and is not zero (all the terms of the sequence are bounded below by a positive constant).
Sorry for being too long in steps that are straightforward, for the most part. Hope this helps!