Effective Capacity and Randomness of Closed Sets

Συγγραφείς: Douglas Cenzer, Paul Brodhead

Πηγή: Electronic Proceedings in Theoretical Computer Science, Vol 24, Iss Proc. CCA 2010, Pp 67-76 (2010)

Θεματικοί όροι: Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95

Περιγραφή αρχείου: electronic resource

Relation: http://arxiv.org/pdf/1006.0397v1; https://doaj.org/toc/2075-2180

Σύνδεσμος πρόσβασης: https://doaj.org/article/be0d3f46a9a0400b8b4549949e05c1b4

Sub-computable Boundedness Randomness

Συγγραφείς: Sam Buss, Douglas Cenzer, Jeffrey B. Remmel

Πηγή: Logical Methods in Computer Science, Vol 10, Issue 4 (2014)

Θεματικοί όροι: computer science - logic in computer science, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95

Περιγραφή αρχείου: electronic resource

Relation: https://lmcs.episciences.org/979/pdf; https://doaj.org/toc/1860-5974

Σύνδεσμος πρόσβασης: https://doaj.org/article/1c87cf73aa5c4752ac4bb27d07fae3e2

Algorithmic Randomness and Capacity of Closed Sets

Συγγραφείς: Douglas Cenzer, Paul Brodhead, Ferit Toska, Sebastian Wyman

Πηγή: Logical Methods in Computer Science, Vol 7, Issue 3 (2011)

Θεματικοί όροι: computer science - logic in computer science, mathematics - logic, f.4.1, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95

Περιγραφή αρχείου: electronic resource

Relation: https://lmcs.episciences.org/1020/pdf; https://doaj.org/toc/1860-5974

Σύνδεσμος πρόσβασης: https://doaj.org/article/9f67e37928e34cbe89677a5f6081b8ec

Generically computable Abelian groups and isomorphisms

Συγγραφείς: Wesley Calvert, Douglas Cenzer, Valentina Harizanov

Πηγή: Journal of Logic and Computation. 35

Extraction Rates of Algorithmically Random Continuous Functionals

Συγγραφείς: Douglas Cenzer, Cameron Fraize, Christopher P. Porter

Πηγή: Natural Computing. 24:17-28

Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic: Volume I: Set Theory

Συγγραφείς: Douglas Cenzer, Christopher Porter, Jindřich Zapletal

Generically and coarsely computable isomorphisms

Συγγραφείς: Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

Πηγή: Computability. 11:223-239

Θεματικοί όροι: injection structure, isomorphism, coarse computability, Computable structure theory, computable model theory, 0102 computer and information sciences, 0101 mathematics, generical computability, equivalence structure, 01 natural sciences, Theory of numerations, effectively presented structures

Περιγραφή αρχείου: application/xml

Complexity of injection structures induced by finite state transducers

Συγγραφείς: Richard Krogman, Douglas Cenzer

Πηγή: Journal of Logic and Computation. 32:1504-1530

Θεματικοί όροι: automatic structures, computability theory, Computable structure theory, computable model theory, finite state transducers, Formal languages and automata, 0102 computer and information sciences, Automata and formal grammars in connection with logical questions, finite state automata, injection structures, 01 natural sciences, Theory of numerations, effectively presented structures

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7638199
https://doi.org/10.1093/logcom/exac065

Randomness extraction in computability theory

Συγγραφείς: Douglas Cenzer, Christopher P. Porter

Πηγή: Computability. 12:1-21

Θεματικοί όροι: algorithmic randomness, Algorithmic randomness and dimension, Turing machines and related notions, computability theory, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, randomness extraction, Mathematics - Logic, 02 engineering and technology, 0101 mathematics, Logic (math.LO), 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2103.03971

Densely computable structures

Συγγραφείς: Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

Πηγή: Journal of Logic and Computation. 32:581-607

Θεματικοί όροι: 0101 mathematics, 01 natural sciences

Generically computable linear orderings

Συγγραφείς: Wesley Calvert, Douglas Cenzer, David Gonzalez, Valentina S. Harizanov

Πηγή: Annals of Pure and Applied Logic, vol 176, iss 8

Θεματικοί όροι: General Mathematics, generic computability, Pure mathematics, Computable structure theory, computable model theory, Computation Theory and Mathematics, Mathematics - Logic, Total orders, Linear ordering, Applied mathematics, Pure Mathematics, Mathematical Sciences, Hierarchies of computability and definability, linear ordering, \( \Sigma_\alpha\) elementary substructure, Sigma alpha elementary substructure, coarse computability, FOS: Mathematics, Generic computability, Coarse computability, Logic (math.LO), Theory of numerations, effectively presented structures, Theory of computation

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.14598
https://zbmath.org/8053974
https://doi.org/10.1016/j.apal.2025.103612
https://escholarship.org/uc/item/4035b169
https://escholarship.org/content/qt4035b169/qt4035b169.pdf

Computability and Categoricity of Weakly Homogeneous Boolean Algebras and p-Groups

Συγγραφείς: Douglas Cenzer, Francis Adams, Keng Meng Ng

Πηγή: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ISBN: 9789811278624

Extraction Rates of Random Continuous Functionals

Συγγραφείς: Douglas Cenzer, Cameron Fraize, Christopher P. Porter

Πηγή: Lecture Notes in Computer Science ISBN: 9783031340338

Generically Computable Abelian Groups

Συγγραφείς: Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov

Πηγή: Lecture Notes in Computer Science ISBN: 9783031340338

Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures: Effective categoricity of automatic equivalence and nested equivalence structures

Συγγραφείς: Jacob Carson, Douglas Cenzer, Jeffrey B. Remmel

Πηγή: Theory of Computing Systems. 64:1110-1139

Θεματικοί όροι: Categoricity and completeness of theories, nested equivalence structures, automatic structures, equivalence structures, computable structures, Computable structure theory, computable model theory, online structures, 0102 computer and information sciences, 0101 mathematics, effective categoricity, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7240648
https://doi.org/10.1007/s00224-020-09974-9

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

Συγγραφείς: Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel

Πηγή: Journal of Logic and Computation. 30:107-156

Θεματικοί όροι: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Σύνδεσμος πρόσβασης: https://academic.oup.com/logcom/article-pdf/30/1/107/33016399/exaa005.pdf

The Isomorphism Problem for FST Injection Structures

Συγγραφείς: Douglas Cenzer, Richard Krogman

Πηγή: Lecture Notes in Computer Science ISBN: 9783030930998

Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic: Volume II: Foundations of Mathematics

Συγγραφείς: Douglas Cenzer, Jean Larson, Christopher Porter, Jindřich Zapletal

Complexity and Categoricity of Injection Structures Induced by Finite State Transducers

Συγγραφείς: Richard Krogman, Douglas Cenzer

Πηγή: Lecture Notes in Computer Science ISBN: 9783030800482

Logic Programming and Effectively Closed Sets

Συγγραφείς: Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel

Πηγή: Structure and Randomness in Computability and Set Theory ISBN: 9789813228221