Go back to Dagstuhl Reports 
AmbosSpies, Klaus ;
Brattka, Vasco ;
Downey, Rodney ;
Lempp, Steffen
Weitere Beteiligte (Hrsg. etc.): Klaus AmbosSpies and Vasco Brattka and Rodney Downey and Steffen Lempp
pdfformat: 

@Article{ambosspies_et_al:DR:2017:7354, author = {Klaus AmbosSpies and Vasco Brattka and Rodney Downey and Steffen Lempp}, title = {{Computability Theory (Dagstuhl Seminar 17081)}}, pages = {89101}, journal = {Dagstuhl Reports}, ISSN = {21925283}, year = {2017}, volume = {7}, number = {2}, editor = {Klaus AmbosSpies and Vasco Brattka and Rodney Downey and Steffen Lempp}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7354}, URN = {urn:nbn:de:0030drops73540}, doi = {10.4230/DagRep.7.2.89}, annote = {Keywords: algorithmic randomness, computability theory, computable algebra, computable analysis, generic case complexity, proof mining} }
Keywords:  algorithmic randomness, computability theory, computable algebra, computable analysis, generic case complexity, proof mining  
Seminar:  Dagstuhl Reports, Volume 7, Issue 2  
Issue Date:  2017  
Date of publication:  18.09.2017 