In this introductory talk we will discuss basic concepts of real computation theory. In particular, we will define the computability and complexity of real functions and subsets of R^n. We will present some recent results about the computability and complexity of Julia sets in this context. No prior knowledge about the area will be assumed.