computability and complexity in real or complex analysis

Computable analysis studies questions like computability and complexity of real numbers, real functions and operators. A major difference with classical computability theory is that inputs and outputs can be infinite objects (like a real number), whereas in classical computability theory the input and the outputs are represented by finite strings from an alphabet.

  • Use this tag if you are interested in computability or complexity of functions over higher-type objects.
  • Use for questions where inputs are floating point numbers or any other fixed approximation representation (i.e. the algorithm cannot ask for arbitrary amount of precision approximation to the inputs).
  • Use or for questions about classical models of computation (inputs are represented as natural numbers or finite strings).