Search Results - abstracts AND ((automatic OR automatizacia) OR automation) computability AND recursion theory*

On Strong and Weak Logics for Paraconsistent Computability.

Authors: Weber, Zach Cano-Jorge, Fernando

Source: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p

Subject Terms: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

Automata and Computability : A Programmer's Perspective

Authors: Ganesh Gopalakrishnan

Resource Type: eBook.

Subjects: Digital control systems--Programming, Automatic control--Data processing, Machine theory

Categories: COMPUTERS / General, COMPUTERS / Programming / Games, COMPUTERS / Information Theory, MATHEMATICS / General, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Engineering (General)

Conceptualising Programming Language Semantics.

Authors: Astarte, Troy Kaighin

Source: Philosophies; Aug2025, Vol. 10 Issue 4, p90, 22p

Subject Terms: PROGRAMMING languages, SEMANTICS, COMPUTER science education, HISTORICAL analysis, THEORY of knowledge, METAPHOR

REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS: Reducibility in some categories of partial recursive operators

Authors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Contributors: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Source: Mathematical Logic Quarterly. 38:349-359

Subject Terms: Categories of machines, automata, partial recursive operators, reducibility, 01 natural sciences, partial recursive operator, dominical categories, Recursion categories, recursion categories, completeness, dominical categorie, creativeness, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Theory of numerations, effectively presented structures, domains

File Description: application/xml; application/pdf; STAMPA

Access URL: https://zbmath.org/584617
https://doi.org/10.1002/malq.19920380133
https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.19920380133
https://philpapers.org/rec/BIARIS
https://hdl.handle.net/11365/1082757
https://doi.org/10.1002/malq.19920380133

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

Authors: Kulyukin, Vladimir A.

Source: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 6, p934, 36p

Subject Terms: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

Research on a General State Formalization Method from the Perspective of Logic.

Authors: Qiu, Siyuan Xu, Jianfeng

Source: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p

Subject Terms: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

A pathological punctually 1-decidable structure.

Authors: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. et al.

Source: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p

Subject Terms: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES: Knuth-Bendix for groups with infinitely many rules

Authors: Paul J. Sanders David B. A. Epstein

Source: International Journal of Algebra and Computation. 10:539-589

Subject Terms: Generators, relations, and presentations of groups, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Group Theory (math.GR), 0102 computer and information sciences, 20F10,20-04,68Q42 (Primary), solvable word problem, 01 natural sciences, regular languages, 03D40,20F32 (Secondary), finitely presented groups, Grammars and rewriting systems, FOS: Mathematics, Knuth-Bendix procedures, 0101 mathematics, finite state automata, Word problems, etc. in computability and recursion theory, Geometric group theory, automatic groups, Mathematics - Group Theory, word reductions

File Description: application/xml

Access URL: http://arxiv.org/pdf/math/0001035
http://arxiv.org/abs/math/0001035
https://zbmath.org/1845101
https://doi.org/10.1142/s0218196700000352
https://dblp.uni-trier.de/db/journals/ijac/ijac10.html#EpsteinS00
https://www.worldscientific.com/doi/10.1142/S0218196700000352

Computability Theory & Automata Theory

Authors: Kristy Plante Tomas Jensen

Resource Type: eBook.

Subjects: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

A Rice’s Theorem for Abstract Semantics

Authors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Contributors: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Subject Terms: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2021.117
https://nbn-resolving.org/urn:nbn:de:0030-drops-141860
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.117

How much partiality is needed for a theory of computability?

Authors: Spreen, Dieter

Source: Computability; 2023, Vol. 12 Issue 4, p371-426, 56p

Subject Terms: COMPUTABLE functions, NATURAL numbers, NUMBER concept, NUMBER theory

Formalization of the Computational Theory of a Turing Complete Functional Language Model.

Authors: Ramos, Thiago Mendonça Ferreira Almeida, Ariane Alves Ayala-Rincón, Mauricio

Source: Journal of Automated Reasoning; Nov2022, Vol. 66 Issue 4, p1031-1063, 33p

Subject Terms: COMPUTABLE functions, MODEL theory, RECURSIVE functions

Computable classifications of continuous, transducer, and regular functions.

Authors: Franklin, Johanna N.Y. Hölzl, Rupert Melnikov, Alexander et al.

Source: Theoretical Computer Science. Mar2025, Vol. 1032, pN.PAG-N.PAG. 1p.

Subject Terms: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION

2024 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Iowa State University Ames, IA, USA May 14–17, 2024.

Source: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p547-579, 33p

Subject Terms: DISCRETE mathematics, MATHEMATICAL logic, PROBABILISTIC automata, PHILOSOPHY of science, MATHEMATICAL equivalence, KOLMOGOROV complexity, COMPUTABLE functions, BIPARTITE graphs, TOPOLOGICAL groups

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

A glimpse into the paradise of combinatory algebra

Authors: W. Richard Stark

Source: International Journal of Computer & Information Sciences. 13:219-236

Subject Terms: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations, combinatory algebra, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science, fixed points, type-free lambda-calculus, functional programming, Formal languages and automata, 02 engineering and technology, Automata and formal grammars in connection with logical questions, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc, foundations of computability theory, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, finite state automaton, 0101 mathematics, Abstract data types, algebraic specification

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/ijpp/ijpp13.html#Stark84
https://link.springer.com/article/10.1007/BF00979873
https://link.springer.com/content/pdf/10.1007/BF00979873.pdf

Graph-Based Automation of Threat Analysis and Risk Assessment for Automotive Security.

Authors: Saulaiman, Mera Nizam-Edden Kozlovszky, Miklos Csilling, Akos

Source: Information; Jun2025, Vol. 16 Issue 6, p449, 38p

Subject Terms: INFORMATION technology, FINITE state machines, DATABASES, RISK assessment, PATH analysis (Statistics), CYBER physical systems

Online, Computable and Punctual Structure Theory.

Authors: Askes, Matthew Downey, Rod

Source: Logic Journal of the IGPL; Dec2023, Vol. 31 Issue 6, p1251-1293, 43p

Subject Terms: COMPUTABLE functions, STRUCTURAL analysis (Engineering), GRAPH algorithms, STRUCTURAL frames, ONLINE algorithms

Structured Dynamics in the Algorithmic Agent.

Authors: Ruffini, Giulio Castaldo, Francesca Vohryzek, Jakub

Source: Entropy; Jan2025, Vol. 27 Issue 1, p90, 54p

Subject Terms: COMPUTATIONAL intelligence, NOETHER'S theorem, INFORMATION theory, GROUP theory, KOLMOGOROV complexity, MIRROR neurons

2022 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Cornell University Ithaca, NY, USA April 7–10, 2022.

Source: Bulletin of Symbolic Logic; Dec2022, Vol. 28 Issue 4, p536-565, 30p

Subject Terms: MATHEMATICAL logic, COMPUTABLE functions, LOGICAL prediction, PROBABILITY theory

Company/Entity: CORNELL University