Search Results - "Computability and recursion theory"

Giovanni in Paris

Authors: Christian Choffrut

Source: International Journal of Foundations of Computer Science. 36:269-283

Subject Terms: Presburger arithmetic, Theory of computing, Model theory, multiautomata, communication complexity, finite two-way automata, unary languages, Computability and recursion theory

File Description: application/xml

Leftmost Derivations in CD Grammar Systems: Leftmost derivations in CD grammar systems

Authors: Henning Bordihn György Vaszil

Source: International Journal of Foundations of Computer Science. 36:247-267

Subject Terms: Theory of computing, leftmost derivations, Computability and recursion theory, Computer science, cooperating distributed grammar systems

File Description: application/xml

Access URL: https://zbmath.org/8034699
https://doi.org/10.1142/s0129054125430038

ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS: On a conjecture regarding the mouse order for weasels

Authors: JAN KRUSCHEWSKI FARMER SCHLUTZENBERG

Source: The Journal of Symbolic Logic. 90:364-390

Subject Terms: inner model theory, Large cardinals, Other aspects of forcing and Boolean-valued models, Inner models, including constructibility, ordinal definability, and core models, 03E45, 03E55, 03D60, 03E40, FOS: Mathematics, admissibility, Mathematics - Logic, 0101 mathematics, Logic (math.LO), 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc

File Description: application/xml

Access URL: http://arxiv.org/abs/2207.06136

Control Structures in Computable Numberings and the Completion Operator: Control structures in computable numberings and the completion operator

Authors: Faizrahmanov, Marat

Source: Theory of Computing Systems. 69

Subject Terms: computable numbering, complete numbering, Other degrees and reducibilities in computability and recursion theory, completion, universal numbering, Theory of numerations, effectively presented structures, principal numbering, Recursive functions and relations, subrecursive hierarchies

File Description: application/xml

Access URL: https://zbmath.org/8037355
https://doi.org/10.1007/s00224-025-10222-1

Reifying dynamical algebra: Maximal ideals in countable rings, constructively: Reifying dynamical algebra: maximal ideals in countable rings, constructively

Authors: Blechschmidt, Ingo Schuster, Peter

Source: Computability. :1-35

Subject Terms: constructive commutative algebra, maximal ideals, dynamical algebra, set-theoretic forcing, 0102 computer and information sciences, 0101 mathematics, Computability and recursion theory, Maximal ideals, set-theoretic forcing, constructive commutative algebra, dynamical algebra, 01 natural sciences

File Description: application/xml

Access URL: https://hdl.handle.net/11562/1146551
https://doi.org/10.3233/com-230454
https://content.iospress.com/articles/computability/com230454

On the Weihrauch degree of the additive Ramsey theorem

Authors: Arno Pauly Cécilia Pradic Giovanni Solda

Source: COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Σ02-induction, Reverse mathematics, \(\Sigma_0^2\)-induction, Mathematics - Logic, Computability and recursion theory, 01 natural sciences, Weihrauch reducibility, Logic in Computer Science (cs.LO), 03B30, 03D78, 03D30, Mathematics and Statistics, additive Ramsey, FOS: Mathematics, reverse mathematics, 0101 mathematics, Logic (math.LO)

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2301.02833
https://zbmath.org/7990924
https://doi.org/10.3233/com-230437
https://cronfa.swan.ac.uk/Record/cronfa65433/Download/65433__29429__ba54a781485648d4b0a7cfee27e7042a.pdf
http://hdl.handle.net/1854/LU-01JYY8WKMWGBJ95DFJE9M7PDV2
http://doi.org/10.3233/com-230437
https://biblio.ugent.be/publication/01JYY8WKMWGBJ95DFJE9M7PDV2
https://biblio.ugent.be/publication/01JYY8WKMWGBJ95DFJE9M7PDV2/file/01JYY9QNHH5RSMRVNAEH0XWCAG

Complemented subsets and Boolean-valued, partial functions

Authors: Misselbeck-Wessel, Daniel Petrakis, Iosif

Source: Computability. :1-33

Subject Terms: partial functions, complemented subsets, swap algebras, Boolean algebras, Boolean rings, swap algebras, swap rings, constructive mathematics, 0102 computer and information sciences, 0101 mathematics, Computability and recursion theory, Bishop set theory, 01 natural sciences

File Description: application/xml

On the first-order parts of problems in the Weihrauch degrees

Authors: Dzhafarov, Damir D. Solomon, Reed Yokoyama, Keita

Source: Computability. :1-13

Subject Terms: FOS: Mathematics, Mathematics - Logic, 0101 mathematics, Computability and recursion theory, Logic (math.LO), 01 natural sciences

File Description: application/xml

Access URL: http://arxiv.org/abs/2301.12733

Ideal presentations and numberings of some classes of effective quasi-Polish spaces

Authors: De Brecht, Matthew Kihara, Takayuki Selivanov, Victor

Source: Computability. :1-24

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, degree spectrum, effective quasi-Polish space, effective domain, Mathematics - Logic, Computability and recursion theory, 01 natural sciences, Logic in Computer Science (cs.LO), index set, FOS: Mathematics, numbering, 0101 mathematics, Logic (math.LO)

File Description: application/xml

Access URL: http://arxiv.org/abs/2301.08469

Hierarchical Quantum Secret Sharing Based On Quantum Fourier Transform: Hierarchical quantum secret sharing based on quantum Fourier transform

Authors: Chen, Ke-Qin Cai, Bin-Bin Lin, Song et al.

Source: International Journal of Theoretical Physics. 63

Subject Terms: Foundations, quantum information and its processing, quantum axioms, and philosophy, quantum Fourier transform, Communication, information, linear homogeneous recurrence relation, quantum cryptography, Computability and recursion theory, hierarchical quantum secret sharing

File Description: application/xml

Access URL: https://zbmath.org/7982350
https://doi.org/10.1007/s10773-024-05864-9

COMPUTABLE TOPOLOGICAL GROUPS: Computable topological groups

Authors: Koh, Heer Tern Melnikov, Alexander G. Ng, Keng Meng

Source: The Journal of Symbolic Logic. 90:188-220

Subject Terms: Birkhoff-Kakutani theorem, Applications of computability and recursion theory, Polish groups, computable groups, FOS: Mathematics, 03D78 (Primary), Mathematics - Logic, 0102 computer and information sciences, right-c.e. Polish presentation, 0101 mathematics, Logic (math.LO), 01 natural sciences, topological groups

File Description: application/xml

Access URL: http://arxiv.org/abs/2209.04617
https://zbmath.org/8036441
https://doi.org/10.1017/jsl.2023.67

Algorithmically random series

Authors: Downey, Rodney G. Greenberg, Noam Tanggara, Andrew

Source: Computability. :1-13

Subject Terms: algorithmic randomness, Payley-Zygmund series, Martin-Löf randomness, Rademacher series, 0101 mathematics, Computability and recursion theory, Schnorr randomness, 01 natural sciences, Kurtz randomness, random trigonometric series

File Description: application/xml

Execution trace sets for real computation

Authors: Declan Thompson

Source: Theoretical Computer Science. 940:2-17

Subject Terms: general algorithms, Blum-Shub-Smale machine, real computation, 0102 computer and information sciences, 0101 mathematics, Computation over the reals, computable analysis, Abstract and axiomatic computability and recursion theory, 01 natural sciences, trace semantics

File Description: application/xml

Language Learnability in the Limit: A Generalization of Gold’s Theorem: Language learnability in the limit: a generalization of Gold's theorem

Authors: Fernando C. Alves

Source: Journal of Logic, Language and Information. 32:363-372

Subject Terms: recursion theory, inductive inference, Computational learning theory, learning in the limit, Formal languages and automata, 06 humanities and the arts, 0101 mathematics, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Gold's theorem

File Description: application/xml

Access URL: https://zbmath.org/7726393
https://doi.org/10.1007/s10849-022-09391-w

On a General Method of Constructing Post Reducibilities and the Corresponding Completeness Criteria: On a general method of constructing post reducibilities and the corresponding completeness criteria

Authors: Arslanov, M. M.

Source: Lobachevskii Journal of Mathematics. 43:3430-3434

Subject Terms: \(m\)-reducibility, \(Q\)-reducibility, Recursively (computably) enumerable sets and degrees, Other degrees and reducibilities in computability and recursion theory, completeness criterion, \(tt\)-reducibility, Turing reducibility, fixed points of function

File Description: application/xml

Topological reducibilities for discontinuous functions and their structures

Authors: Kihara, Takayuki

Source: Israel Journal of Mathematics. 252:461-500

Subject Terms: Determinacy principles, 03D30, 03E15, 03E60, 03D55, 26A21, General Topology (math.GN), FOS: Mathematics, Other degrees and reducibilities in computability and recursion theory, Mathematics - Logic, 0101 mathematics, Logic (math.LO), Descriptive set theory, 01 natural sciences, Mathematics - General Topology

File Description: application/xml

Access URL: http://arxiv.org/abs/1906.10573

Completeness Criteria for a Class of Reducibilities: Completeness criteria for a class of reducibilities

Authors: Arslanov, M. M.

Source: Russian Mathematics. 66:62-66

Subject Terms: m-reducibility, Q-reducibility, Other Turing degree structures, Other degrees and reducibilities in computability and recursion theory, completeness criterion, 0101 mathematics, 01 natural sciences, Turing reducibility, tt-reducibility, fixed points of function

File Description: application/xml

Access URL: https://zbmath.org/7659051
https://doi.org/10.3103/s1066369x22100012

Defining Long Words Succinctly in FO and MSO: Defining long words succinctly in FO and MSO

Authors: Lauri Hella Miikka Vilander Berger, Ulrich et al.

Contributors: Lauri Hella Miikka Vilander Berger, Ulrich et al.

Source: Lecture Notes in Computer Science ISBN: 9783031087394

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 213 Electronic, automation and communications engineering, electronics, monadic second-order logic, logic on words, succinctness, Mathematics - Logic, 0102 computer and information sciences, Computability and recursion theory, 01 natural sciences, Logic in Computer Science (cs.LO), FOS: Mathematics, F.4.1, 0101 mathematics, Logic (math.LO)

File Description: application/xml; fulltext

Access URL: http://arxiv.org/abs/2202.10180
https://zbmath.org/7990921
https://doi.org/10.3233/com-230450
https://trepo.tuni.fi/handle/10024/141524

Hilbert’s Tenth Problem for Term Algebras with a Substitution Operator: Hilbert's tenth problem for term algebras with a substitution operator

Authors: Juvenal Murwanashyaka

Source: Lecture Notes in Computer Science ISBN: 9783031087394

Subject Terms: term algebras, substitution operator, Computability and recursion theory, Hilbert's 10th problem

File Description: application/xml

Access URL: http://hdl.handle.net/10852/94701
https://doi.org/10.1007/978-3-031-08740-0_17
https://hdl.handle.net/11104/0361585

Die beschränkt-rekursiven Funktionen und die Ackermannsche Majorisierungsmethode

Authors: Péter, Rózsa

Source: Publicationes Mathematicae Debrecen. 4:362-375

Subject Terms: 0101 mathematics, Computability and recursion theory, unboundedness, 01 natural sciences, primitive recursive function

File Description: application/xml

Access URL: https://zbmath.org/3116592