Add to ORKGThis thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations
We present a survey of our work over the last four decades on generalizations of computability theor...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
Tanenbaum, Trenk, and Fishburn introduced the concept of linear discrepancy in 2001, proposing it...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a norm...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We present a survey of our work over the last four decades on generalizations of computability theor...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
Tanenbaum, Trenk, and Fishburn introduced the concept of linear discrepancy in 2001, proposing it...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a norm...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Tur...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
What can we compute--even with unlimited resources? Is everything within reach? Or are computations ...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
We present a survey of our work over the last four decades on generalizations of computability theor...
This book is a development of class notes for a two-hour lecture including a two-hour lab held for s...
Tanenbaum, Trenk, and Fishburn introduced the concept of linear discrepancy in 2001, proposing it...