Douglas A. Cenzer

According to our database, Douglas A. Cenzer authored at least 96 papers between 1974 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Randomness extraction in computability theory.

Douglas Cenzer, Christopher P. Porter

Comput., 2023

Extraction Rates of Random Continuous Functionals.

Douglas Cenzer, Cameron Fraize, Christopher P. Porter

Proceedings of the Unconventional Computation and Natural Computation, 2023

Generically Computable Abelian Groups.

Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

Proceedings of the Unconventional Computation and Natural Computation, 2023

2022

Complexity of injection structures induced by finite state transducers.

Richard Krogman, Douglas Cenzer

J. Log. Comput., 2022

Densely computable structures.

Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

J. Log. Comput., 2022

Generically and coarsely computable isomorphisms.

Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

Comput., 2022

The Isomorphism Problem for FST Injection Structures.

Douglas Cenzer, Richard Krogman

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021

Complexity and Categoricity of Injection Structures Induced by Finite State Transducers.

Richard Krogman, Douglas Cenzer

Proceedings of the Connecting with Computability, 2021

2020

Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures.

Jacob Carson, Douglas Cenzer, Jeffrey B. Remmel

Theory Comput. Syst., 2020

On the complexity of index sets for finite predicate logic programs which allow function symbols.

Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel

J. Log. Comput., 2020

2018

The Random Members of a Π₁⁰ Class.

Douglas Cenzer, Christopher P. Porter

Theory Comput. Syst., 2018

Online Computability and Differentiation in the Cantor Space.

Douglas Cenzer, Diego A. Rojas

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

The Probability of a Computable Output from a Random Oracle.

George Barmpalias, Douglas Cenzer, Christopher P. Porter

ACM Trans. Comput. Log., 2017

Random numbers as probabilities of machine behavior.

George Barmpalias, Douglas Cenzer, Christopher P. Porter

Theor. Comput. Sci., 2017

Computability and categoricity of weakly ultrahomogeneous structures.

Francis Adams, Douglas Cenzer

Comput., 2017

Injection Structures Specified by Finite State Transducers.

Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel

Proceedings of the Computability and Complexity, 2017

2016

Random numbers as probabilities of machine behaviour.

George Barmpalias, Douglas A. Cenzer, Christopher P. Porter

CoRR, 2016

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols.

Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015

Algorithmically Random Functions and Effective Capacities.

Douglas Cenzer, Christopher P. Porter

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

Sub-computable Boundedness Randomness.

Sam Buss, Douglas Cenzer, Jeffrey B. Remmel

Log. Methods Comput. Sci., 2014

Computability and Categoricity of Ultrahomogeneous Structures.

Francis Adams, Douglas Cenzer

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Effective Randomness of Unions and Intersections.

Douglas Cenzer, Rebecca Weber

Theory Comput. Syst., 2013

Two-to-one structures.

Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel

J. Log. Comput., 2013

Index sets for Finite Normal Predicate Logic Programs

Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel

CoRR, 2013

Sub-computable Bounded Pseudorandomness.

Douglas Cenzer, Jeffrey B. Remmel

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012

Computability of Countable Subshifts in One Dimension.

Douglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman

Theory Comput. Syst., 2012

A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs.

Douglas Cenzer, Jeffrey B. Remmel

Ann. Math. Artif. Intell., 2012

2011

Algorithmic Randomness and Capacity of Closed Sets

Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman

Log. Methods Comput. Sci., 2011

Σ⁰₁ and Π⁰₁ equivalence structures.

Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel

Ann. Pure Appl. Log., 2011

A superhigh diamond in the c.e. <i>tt</i>-degrees.

Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu

Arch. Math. Log., 2011

Effective Categoricity of Injection Structures.

Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel

Proceedings of the Models of Computation in Context, 2011

2010

Effective Capacity and Randomness of Closed Sets

Douglas Cenzer, Paul Brodhead

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

Computability of Countable Subshifts.

Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Pseudojumps and Pi₁⁰ Classes.

Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu

J. Log. Comput., 2009

<i>K</i>-Triviality of Closed Sets and Continuous Functions.

George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber

J. Log. Comput., 2009

Equivalence structures and isomorphisms in the difference hierarchy.

Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel

J. Symb. Log., 2009

Effective categoricity of Abelian p-groups.

Wesley Calvert, Douglas A. Cenzer, Valentina S. Harizanov, Andrei S. Morozov

Ann. Pure Appl. Log., 2009

Preface.

Douglas A. Cenzer, Valentina S. Harizanov, David Marker, Carol Wood

Arch. Math. Log., 2009

Space complexity of Abelian groups.

Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin

Arch. Math. Log., 2009

Linear orders with distinguished function symbol.

Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov

Arch. Math. Log., 2009

Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms.

Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu, Guohua Wu

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Immunity for Closed Sets.

Douglas Cenzer, Rebecca Weber, Guohua Wu

Proceedings of the Mathematical Theory and Computational Practice, 2009

S⁰₁ and P⁰₁ Equivalence Structures.

Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Computable symbolic dynamics.

Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King

Math. Log. Q., 2008

Preface.

Douglas A. Cenzer, Rebecca Weber

Arch. Math. Log., 2008

Degrees of difficulty of generalized r.e. separating classes.

Douglas A. Cenzer, Peter G. Hinman

Arch. Math. Log., 2008

Effectively closed sets and enumerations.

Paul Brodhead, Douglas A. Cenzer

Arch. Math. Log., 2008

Algorithmic randomness of continuous functions.

George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber

Arch. Math. Log., 2008

A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs.

Douglas Cenzer, Jeffrey B. Remmel

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

2007

Algorithmic Randomness of Closed Sets.

George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber

J. Log. Comput., 2007

Effective Symbolic Dynamics.

Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Pseudojump Operators and P⁰₁ Classes.

Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu

Proceedings of the Computation and Logic in the Real World, 2007

<i>K</i> -Trivial Closed Sets and Continuous Functions.

George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber

Proceedings of the Computation and Logic in the Real World, 2007

2006

On the complexity of inductive definitions.

Douglas A. Cenzer, Jeffrey B. Remmel

Math. Struct. Comput. Sci., 2006

Complexity, decidability and completeness.

Douglas A. Cenzer, Jeffrey B. Remmel

J. Symb. Log., 2006

Medvedev Degrees of Generalized R.E. separating Classes.

Douglas Cenzer, Peter G. Hinman

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Preface.

Douglas Cenzer, Ruth Dillhage, Tanja Grubba, Klaus Weihrauch

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Random Continuous Functions.

Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Effective categoricity of equivalence structures.

Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov, Andrei S. Morozov

Ann. Pure Appl. Log., 2006

Logspace Complexity of Functions and Structures.

Douglas Cenzer, Zia Uddin

Proceedings of the Logical Approaches to Computational Barriers, 2006

Random Closed Sets.

Paul Brodhead, Douglas Cenzer, Seyyed Dashti

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Minimal extensions of Pi⁰₁ classes.

Douglas Cenzer, Farzan Riazati

Math. Log. Q., 2005

Logic programming with infinite sets.

Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek

Ann. Math. Artif. Intell., 2005

The Complexity of Inductive Definability.

Douglas A. Cenzer, Jeffrey B. Remmel

Proceedings of the New Computational Paradigms, 2005

2004

Index sets for computable differential equations.

Douglas Cenzer, Jeffrey B. Remmel

Math. Log. Q., 2004

Locally Determined Logic Programs and Recursive Stable Models.

Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt

Ann. Math. Artif. Intell., 2004

Using Logic Programs to Reason about Infinite Sets.

Douglas Cenzer, V. Wiktor Marek, Jeffrey B. Remmel

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

2003

Index sets for omega-languages.

Douglas A. Cenzer, Jeffrey B. Remmel

Math. Log. Q., 2003

Density of the Medvedev lattice of Pi01 classes.

Douglas A. Cenzer, Peter G. Hinman

Arch. Math. Log., 2003

2002

Effectively closed sets and graphs of computable real functions.

Douglas A. Cenzer, Jeffrey B. Remmel

Theor. Comput. Sci., 2002

Common Derivations in Locally Determined Logic Programs.

Douglas Cenzer, Amy Vanderbilt

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2002

2001

Initial Segments of The Lattice of PI⁰₁ Classes.

Douglas A. Cenzer, André Nies

J. Symb. Log., 2001

2000

Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels.

Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999

Index Sets in Computable Analysis.

Douglas A. Cenzer, Jeffrey B. Remmel

Theor. Comput. Sci., 1999

Locally Determined Logic Programs.

Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

∏10 Classes in Computability Theory.

Douglas Cenzer

Proceedings of the Handbook of Computability Theory, 1999

1998

Complexity and Categoricity.

Douglas A. Cenzer, Jeffrey B. Remmel

Inf. Comput., 1998

Index Sets for Pi⁰₁ Classes.

Douglas A. Cenzer, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1998

Preface.

Douglas A. Cenzer, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1998

Feasible Graphs with Standard Universe.

Douglas A. Cenzer, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1998

A Good Oracle Is Hard to Beat.

Douglas A. Cenzer, William R. Moser

Algorithmica, 1998

1995

Feasible Graphs and Colorings.

Jeffrey B. Remmel, Douglas A. Cenzer

Math. Log. Q., 1995

Inductive Inference of Functions on the Rationals.

Douglas A. Cenzer, William R. Moser

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Feasibly Categorial Models.

Douglas A. Cenzer, Jeffrey B. Remmel

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1993

Countable Thin Pi⁰₁ Classes.

Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore

Ann. Pure Appl. Log., 1993

1992

Polynomial-Time Abelian Groups.

Douglas A. Cenzer, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1992

1991

Polynomial-Time versus Recursive Models.

Douglas A. Cenzer, Jeffrey B. Remmel

Ann. Pure Appl. Log., 1991

1989

On the Ranked Points of A pi⁰₁ Set.

Douglas A. Cenzer, Rick L. Smith

J. Symb. Log., 1989

1986

Members of countable π₁⁰ classes.

Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer

Ann. Pure Appl. Log., 1986

1984

Monotone Reducibility and the Family of Infinite Sets.

Douglas A. Cenzer

J. Symb. Log., 1984

1980

Non-generable formal languages.

Douglas A. Cenzer

Fundam. Informaticae, 1980

1978

On vertex k-partitions of certain infinite graphs.

Douglas Cenzer, Edward Howorka

Discret. Math., 1978

1977

Non-Generable RE Sets.

Douglas A. Cenzer

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Monotone Inductive Definitions over the Continuum.

Douglas A. Cenzer

J. Symb. Log., 1976

1974

Analytic Inductive Definitions.

Douglas A. Cenzer

J. Symb. Log., 1974

Cores of pi¹₁ Sets of Reals.

Andreas Blass, Douglas A. Cenzer

J. Symb. Log., 1974