Computation is the part of maths that can effectively be carried out in the world

Computation is often studied via mechanistic models like those formalized in Automata theory. The main models will be explained below, in Models of Computation section.

Language:

A Formal language is a set of strings of symbols that may be constrained by rules that are specific to it. These rules can also be expressed as machines, like finite state machines or Turing machines.

Finite state machine<Context-free languages<Turing machines<Undecidable problems (hypercomputation)

See Chomsky hierarchy in Formal systems and semantics

https://www.youtube.com/watch?v=ZNBNmxXKmUY&index=7&list=PL601FC994BDD963E4. On Lect 3 part 2/10

Computability theory

Computability of functions

Models of computation

See also Automata theory for more. Main examples:

Finite-state machine

Turing machine

Church-Turing thesis

Theory of Computation - Fall 2011 (Course)

Theory of Computation

Theory of Automata, Formal Languages and Computation lect 1

Computability and recursion

AIT lectures

Introduction to computability theory

Unconventional computing

Causal Nets or What Is a Deterministic Computation?

http://www.cs.bu.edu/~gacs/recent-publ.html

http://podcast.ucsd.edu/podcasts/default.aspx?PodcastId=13&v=0