Are Linear Bounded Automatons Turing Complete? Linear Bounded Automatons are just Turing Machines with finite tape, instead of infinite tape. 

But this causes them to not be Turing Complete? Why?
A linear bounded automaton is a Turing machine that runs on input of size $n$ in $\mathcal{O}(n)$ space. By the space hierachy theorem there exist languages that need e.g. $\omega(n^2)$ space.