Skip to main content
Intended for healthcare professionals

Computability is the journal of the association Computability in Europe. It is a peer reviewed international journal that is devoted to publishing original research of highest quality, which is centered around the topic of computability. View full journal description

Browse by

Articles most recently published online for this journal.
Restricted access
Research article
First published  

Set descriptive complexity of solvable functions

  • Olivier Bournez
  • Riccardo Gozzi
Restricted access
Research article
First published  

There is no composition in the [strong] computable reducibility degrees

  • Daniel S Mourad
Restricted access
Research article
First published  

On the computational properties of the Baire category theorem

  • Sam Sanders
Restricted access
Research article
First published  

Complexity issues for the iterated h-preordersa

  • Pavel Alaev
  • Victor Selivanov
View latest issues
Most read articles in this journal in the last 6 months.
Free access
Research article
First published  

Nearly computable real numbers

  • Peter Hertling
  • Philip Janicki
Open Access
Research article
First published  

Defining long words succinctly in FO and MSO

  • Lauri Hella
  • Miikka Vilander
Open Access
Obituary
First published  

Barry Cooper (1943–2015): The engine of Computability in Europe

  • Benedikt Löwe
Free access
Research article
First published  

Enumerations of families closed under finite differences

  • Noam Greenberg
  • Matthew Harrison-Trainor
  • Joseph S. Miller
  • Dan Turetsky
View all
Most cited articles published in this journal in the last 3 years. These statistics are updated weekly using data sourced exclusively from CrossRef.
Restricted access
Research article
First published  

Numberings, c.e. oracles, and fixed points

  • Marat Faizrahmanov
Restricted access
Research article
First published  

Strong computable type

  • Djamel Eddine Amir
  • Mathieu Hoyrup
Restricted access
Research article
First published  

Effectively infinite classes of numberings and computable families of reals

  • Marat Faizrahmanov
  • Zlata Shchedrikova
Restricted access
Research article
First published  

L2-Betti numbers and computability of reals

  • Clara Löh
  • Matthias Uschold
View all
Articles with the highest Altmetric score from the last 3 months, indicating influence and impact.

You might be interested in

Publish with us

Authors will enjoy:

  • Rigorous peer review of your research
  • Prompt publishing
  • Multidisciplinary audience
  • High visibility for global exposure
Submit Now

Information for Authors, Editors, and Reviewers

Sage supports authors, editors, and reviewers throughout all steps of the publishing process. Explore our resources:

Sage discipline hubs

Explore the content from across our disciplines, including the latest journal articles, special issues, and related books and digital library content.
View More

Also from Sage