Johanna N. Y. Franklin

According to our database, Johanna N. Y. Franklin authored at least 24 papers between 2008 and 2024.

Collaborative distances:

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

2024

Preface of the special issue for the conference computability in Europe 2022.

Ulrich Berger, Johanna N. Y. Franklin, Elvira Mayordomo

Comput., 2024

2023

Structural Highness Notions.

Wesley Calvert, Johanna N. Y. Franklin, Dan Turetsky

J. Symb. Log., 2023

2021

A Church-Turing Thesis for Randomness?

Johanna N. Y. Franklin

Proceedings of the Connecting with Computability, 2021

2020

Lowness for isomorphism, countable ideals, and computable traceability.

Johanna N. Y. Franklin, Reed Solomon

Math. Log. Q., 2020

Degrees of and lowness for isometric isomorphism.

Johanna N. Y. Franklin, Timothy H. McNicholl

J. Log. Anal., 2020

2019

Algorithmic Randomness and Fourier Analysis.

Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute

Theory Comput. Syst., 2019

Taking the path computably traveled.

Johanna N. Y. Franklin, Dan Turetsky

J. Log. Comput., 2019

2018

Lowness for isomorphism and degrees of genericity.

Johanna N. Y. Franklin, Dan Turetsky

Comput., 2018

2017

Strength and Weakness in Computable Structure Theory.

Johanna N. Y. Franklin

Proceedings of the Computability and Complexity, 2017

2015

Genericity and UD-random reals.

Wesley Calvert, Johanna N. Y. Franklin

J. Log. Anal., 2015

2014

Lowness for Difference Tests.

David Diamondstone, Johanna N. Y. Franklin

Notre Dame J. Formal Log., 2014

<i>ω</i>-Change Randomness and Weak Demuth Randomness.

Johanna N. Y. Franklin, Keng Meng Ng

J. Symb. Log., 2014

Degrees that Are Low for Isomorphism.

Johanna N. Y. Franklin, Reed Solomon

Comput., 2014

2013

Degrees of Categoricity and the Hyperarithmetic Hierarchy.

Barbara F. Csima, Johanna N. Y. Franklin, Richard A. Shore

Notre Dame J. Formal Log., 2013

Anti-complex sets and reducibilities with tiny use.

Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu

J. Symb. Log., 2013

Local Computability for Ordinals.

Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2011

Van Lambalgen's Theorem and High Degrees.

Johanna N. Y. Franklin, Frank Stephan

Notre Dame J. Formal 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

2010

Subclasses of the Weakly Random Reals.

Johanna N. Y. Franklin

Notre Dame J. Formal Log., 2010

Schnorr trivial sets and truth-table reducibility.

Johanna N. Y. Franklin, Frank Stephan

J. Symb. Log., 2010

Schnorr triviality and genericity.

Johanna N. Y. Franklin

J. Symb. Log., 2010

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

2008

Hyperimmune-free degrees and Schnorr triviality.

Johanna N. Y. Franklin

J. Symb. Log., 2008

Schnorr trivial reals: a construction.

Johanna N. Y. Franklin

Arch. Math. Log., 2008