Search Results - publications of computability and recursion theory

On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability.

Authors: Kulyukin, Vladimir A.

Source: Mathematics (2227-7390); Jul2025, Vol. 13 Issue 13, p2090, 24p

Subject Terms: RECURSION theory, MATHEMATICAL logic, PROOF theory, PROGRAMMING languages

On Signifiable Computability: Part II: An Axiomatization of Signifiable Computation and Debugger Theorems

Authors: Kulyukin, Vladimir A. MDPI AG

Contributors: Kulyukin, Vladimir A. MDPI AG

Source: Computer Science Faculty and Staff Publications

Subject Terms: computability theory, recursion theory, signifiable computability, axiomatization, debugger theorems, discretely finite real numbers, number theory, Computer Sciences, Physical Sciences and Mathematics

File Description: application/pdf

Relation: https://digitalcommons.usu.edu/computer_science_facpubs/57; https://digitalcommons.usu.edu/context/computer_science_facpubs/article/1057/viewcontent/COMSfacpub2025_Kulyukin_SignifiableComputability.pdf

Availability: https://digitalcommons.usu.edu/computer_science_facpubs/57
https://doi.org/10.3390/math13060934
https://digitalcommons.usu.edu/context/computer_science_facpubs/article/1057/viewcontent/COMSfacpub2025_Kulyukin_SignifiableComputability.pdf

Computability of pressure for subshifts on countable amenable groups.

Authors: Hedges, C Evans Pavlov, Ronnie

Source: Nonlinearity; Jul2025, Vol. 38 Issue 7, p1-22, 22p

Subject Terms: ENTROPY (Information theory), ALGORITHMS, DYNAMICAL systems, RECURSION theory, UNCERTAINTY (Information theory)

Countability constraints in order-theoretic approaches to computability.

Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p

Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY

Partial Elements and Recursion via Dominances in Univalent Type Theory

Authors: Escardó, Martín H. Knapp, Cory M. Martín H. Escardó and Cory M. Knapp

Contributors: Escardó, Martín H. Knapp, Cory M. Martín H. Escardó and Cory M. Knapp

Subject Terms: univalent type theory, homotopy type theory, partial function, dominance, recursion theory, computability theory

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.21

Availability: https://doi.org/10.4230/LIPIcs.CSL.2017.21
https://nbn-resolving.org/urn:nbn:de:0030-drops-76822
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.21

Recursion Theory

Authors: Joseph R. Shoenfield

Resource Type: eBook.

Subjects: Mathematics, Logic, Recursion theory, Computer science, Electronic data processing

Categories: MATHEMATICS / Logic

Computability theory

Authors: Zimmermann, Karl-Heinz

Subject Terms: computability, Turing machine, Informatik, undecidability, recursion theory, Mathematik, word problems

Computably Enumerable Semisimple Rings.

Authors: Wu, Huishan

Source: Mathematics (2227-7390); Feb2025, Vol. 13 Issue 3, p337, 23p

Subject Terms: RECURSION theory, UNIVERSAL algebra, NONCOMMUTATIVE algebras, RING theory, QUOTIENT rings, COMPUTABLE functions, CONGRUENCE lattices

Computability theory

Authors: Zimmermann, Karl-Heinz

Subject Terms: computability, recursion theory, undecidability, word problems, complexity theory, 510: Mathematik

Time: 510

File Description: application/pdf

Relation: http://tubdok.tub.tuhh.de/handle/11420/1717; 11420/1717

Availability: http://tubdok.tub.tuhh.de/handle/11420/1717
https://nbn-resolving.org/urn:nbn:de:gbv:830-88221834
https://doi.org/10.15480/882.1714

Computability Theory

Authors: Zimmermann, Karl-Heinz

Subject Terms: computability, recursion theory, undecidability, word problems, complexity, 510: Mathematik

Time: 510

File Description: application/pdf

Relation: http://tubdok.tub.tuhh.de/handle/11420/1312; 11420/1312

Availability: http://tubdok.tub.tuhh.de/handle/11420/1312
https://nbn-resolving.org/urn:nbn:de:gbv:830-88214582
https://doi.org/10.15480/882.1309

Computability Theory

Authors: Rebecca Weber

Resource Type: eBook.

Subjects: Recursion theory, Computable functions

NOTICES.

Source: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p615-620, 6p

Subject Terms: RECURSION theory, MATHEMATICAL logic, MIDDLE class, MODAL logic, WAGE decreases

Computability Theory : An Introduction to Recursion Theory, Students Solutions Manual (e-only)

Authors: Herbert B. Enderton

Resource Type: eBook.

Categories: MATHEMATICS / General

Computability Theory : An Introduction to Recursion Theory

Authors: Herbert B. Enderton

Resource Type: eBook.

Categories: COMPUTERS / Information Theory, MATHEMATICS / General, MATHEMATICS / Applied

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

Can Church's thesis be viewed as a Carnapian explication?

Authors: Quinon, Paula

Source: Synthese; Mar2021 Supplement 5, Vol. 198, p1047-1074, 28p

Subject Terms: RECURSION theory, MATHEMATICAL logic, MATHEMATICAL forms

People: CARNAP, Rudolf, 1891-1970

Computability

Authors: George Tourlakis

Resource Type: eBook.

Subjects: Computable functions, Recursion theory, Computational complexity, Computer science, Technology—Philosophy

Categories: COMPUTERS / Computer Science, MATHEMATICS / Logic, SCIENCE / Philosophy & Social Aspects, TECHNOLOGY & ENGINEERING / General

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

Recursion Theory : Lecture Notes in Logic 1

Authors: Joseph R. Shoenfield

Resource Type: eBook.

Subjects: Recursion theory

Categories: MATHEMATICS / General, MATHEMATICS / Set Theory