( en | de | ru )

 

Disambiguation of "Day, Adam R."

Author of the publication

copydeleteadd this publication to your clipboard
On Process Complexity.

. CATS, volume 94 of CRPIT, page 29-34. Australian Computer Society, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Meike -R Adam

Tim R Adam

Markus Day

Hans Day

Peter Day

 

Other publications of authors with the same name

The computable Lipschitz degrees of computably enumerable sets are not dense.. Ann. Pure Appl. Log., 161 (12): 1588-1602 (2010)On Process Complexity.. Chic. J. Theor. Comput. Sci., (2010)On Process Complexity.. CATS, volume 94 of CRPIT, page 29-34. Australian Computer Society, (2009)Computing k-Trivial Sets by Incomplete Random Sets., , , , , , and . Bull. Symb. Log., 20 (1): 80-90 (2014)Independence, Relative Randomness, and PA Degrees., and . Notre Dame J. Formal Log., 55 (1): 1-10 (2014)On the strength of two Recurrence theorems.. J. Symb. Log., 81 (4): 1357-1374 (2016)On the computational power of random strings.. Ann. Pure Appl. Log., 160 (2): 214-228 (2009)Indifferent sets for genericity.. J. Symb. Log., 78 (1): 113-138 (2013)Jump Operations for Borel graphs., and . J. Symb. Log., 83 (1): 13-28 (2018)Process and truth-table characterisations of randomness.. Theor. Comput. Sci., (2012)