Dusko Pavlovic was born in Sarajevo, studied mathematics and programming in Utrecht, taught at McGill, Imperial College London, Oxford, and Royal Holloway, before joining University of Hawaii in 2014. In the meantime he also spent 12 years thinking and talking about applications in Palo Alto CA. His research interests evolved from pure mathematics, through theoretical computer science and software engineering, to network computation and security, with excursions into quantum computation and game theory. He authored more than 100 refereed publications. In his ample spare time he enjoys providing strategic advice to his 3 children and writing about himself in third person.

• 1. Drawing Types and Functions.- 2. Monoidal Computer: Computability as a Structure.- 3. Fixpoints.- 4. What can be Computed.- 5. What cannot be Computed.- 6. Computing Programs.- 7. Program-Closed Categories: Computability as a Property.- 8. Computable Categories and Effective Categorical Operations.

Dusko Pavlovic was born in Sarajevo, studied mathematics and programming in Utrecht, taught at McGill, Imperial College London, Oxford, and Royal Holloway, before joining University of Hawaii in 2014. In the meantime he also spent 12 years thinking and talking about applications in Palo Alto CA. His research interests evolved from pure mathematics, through theoretical computer science and software engineering, to network computation and security, with excursions into quantum computation and game theory. He authored more than 100 refereed publications. In his ample spare time he enjoys providing strategic advice to his 3 children and writing about himself in third person.

• 1. Drawing Types and Functions.- 2. Monoidal Computer: Computability as a Structure.- 3. Fixpoints.- 4. What can be Computed.- 5. What cannot be Computed.- 6. Computing Programs.- 7. Program-Closed Categories: Computability as a Property.- 8. Computable Categories and Effective Categorical Operations.

Dusko Pavlovic was born in Sarajevo, studied mathematics and programming in Utrecht, taught at McGill, Imperial College London, Oxford, and Royal Holloway, before joining University of Hawaii in 2014. In the meantime he also spent 12 years thinking and talking about applications in Palo Alto CA. His research interests evolved from pure mathematics, through theoretical computer science and software engineering, to network computation and security, with excursions into quantum computation and game theory. He authored more than 100 refereed publications. In his ample spare time he enjoys providing strategic advice to his 3 children and writing about himself in third person.

• 1. Drawing Types and Functions.- 2. Monoidal Computer: Computability as a Structure.- 3. Fixpoints.- 4. What can be Computed.- 5. What cannot be Computed.- 6. Computing Programs.- 7. Program-Closed Categories: Computability as a Property.- 8. Computable Categories and Effective Categorical Operations.