Dr Jens Blanck
Associate Professor
Computer Science
Telephone: (01792) 602917
Room: Office - 333
Third Floor
Computational Foundry
Bay Campus

Areas of Expertise

  • computability
  • domain theory
  • domain representations
  • computable real numbers
  • exact computations
  • exact real arithmetic
  • continuous data types

Publications

  1. Tucker, J, Stoltenberg-Hansen, V, Blanck, J Stability for Effective AlgebrasElectronic Notes in Theoretical Computer Science2213
  2. Blanck, J, Stoltenberg-Hansen, V, Tucker, J Stability of representations of effective partial algebrasMathematical Logic Quarterly
  3. Bauer, A, Blanck, J Canonical effective subalgebras of classical algebras as constructive metric completionsJournal of Universal Computer Science161824962522
  4. BLANCK, J Reducibility of domain representations and Cantor–Weihrauch domain representationsMathematical Structures in Computer Science180610311056
  5. Blanck, J Efficient exact computation of iterated mapsThe Journal of Logic and Algebraic Programming64141

See more...

Teaching

  • CS-175 Modelling Computing Systems 2

    This module will follow on from CS-170 and introduces students to mathematical tools and techniques for modelling computing systems.

  • CS-210 Concurrency

    This module provides an introduction to the issues raised in developing and using concurrent and distributed systems. Consideration of practical and formal solutions to example problems from operating systems and networking.

  • CS-270 Algorithms

    This module introduces students to the formal concepts of algorithms and data structures and will enable them to understand how the selection of different algorithms and data types affects the performance and efficiency of a program. Particular attention will be paid to the fundamental problems of searching, sorting, and graph traversal.

  • HUP170 Introduction to Logic

    This module introduces students to the language and tools of classical elementary logic and addresses questions about the relations between formal and natural languages. It cultivates students¿ ability to translate complex natural language passages into formal claims and arguments, to assess their validity, and to engage with such further philosophical topics as: analyticity, apriority, necessity, descriptions, existence, identity, truth, meaning and reference. Finally, students will engage with various techniques required for reasoning about complex systems.