Suchergebnisse - abstracts and ((automatic OR automation) OR automatizace) computability and recursion theory*

On Strong and Weak Logics for Paraconsistent Computability.

Autoren: Weber, Zach Cano-Jorge, Fernando

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

Schlagwörter: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

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

Autoren: Kulyukin, Vladimir A.

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

Schlagwörter: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

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

Autoren: Qiu, Siyuan Xu, Jianfeng

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

Schlagwörter: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

A pathological punctually 1-decidable structure.

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

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

Schlagwörter: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

Automata and Computability : A Programmer's Perspective

Autoren: Ganesh Gopalakrishnan

Resource Type: eBook.

Schlagworte: 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)

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

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

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

A Rice’s Theorem for Abstract Semantics

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

Weitere Verfasser: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng et al.

Schlagwörter: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

Dateibeschreibung: 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

Verfügbarkeit: 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

Computable classifications of continuous, transducer, and regular functions.

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

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

Schlagwörter: *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.

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

Schlagwörter: 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.

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

Schlagwörter: TURING machines, RECURSION theory, DENSITY, MACHINERY

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

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

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

Schlagwörter: INFORMATION technology, FINITE state machines, DATABASES, RISK assessment, PATH analysis (Statistics), CYBER physical systems

Conceptualising Programming Language Semantics.

Autoren: Astarte, Troy Kaighin

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

Schlagwörter: PROGRAMMING languages, SEMANTICS, COMPUTER science education, HISTORICAL analysis, THEORY of knowledge, METAPHOR

Structured Dynamics in the Algorithmic Agent.

Autoren: Ruffini, Giulio Castaldo, Francesca Vohryzek, Jakub

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

Schlagwörter: COMPUTATIONAL intelligence, NOETHER'S theorem, INFORMATION theory, GROUP theory, KOLMOGOROV complexity, MIRROR neurons

Recursion in programs, thought, and language.

Autoren: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert et al.

Quelle: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p

Schlagwörter: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

Robert Rosen's Relational Biology Theory and His Emphasis on Non-Algorithmic Approaches to Living Systems.

Autoren: Lane, Patricia A.

Quelle: Mathematics (2227-7390); Nov2024, Vol. 12 Issue 22, p3529, 29p

Schlagwörter: INCOMPLETENESS theorems, MATHEMATICAL category theory, GRAPH theory, MATHEMATICIANS, MODEL theory

Hierarchical Decompositions and Termination Analysis for Generalized Planning.

Autoren: Srivastava, Siddharth

Quelle: Journal of Artificial Intelligence Research; 2023, Vol. 77, p1203-1236, 34p

Schlagwörter: GENERALIZATION, HIERARCHICAL clustering (Cluster analysis), AUTOMATION, RELIABILITY in engineering, AUTOMATIC differentiation

Automatic reduction of cuch expression by means of the value method: Automatic reduction of CUCH expression by means of the value method

Autoren: G. Ausiello

Quelle: Calcolo. 5:174-184

Schlagwörter: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064

Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions.

Autoren: Yamakami, Tomoyuki

Quelle: Mathematical Structures in Computer Science; Nov2024, Vol. 34 Issue 10, p710-745, 36p

Schlagwörter: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

Characterisation of the set of ground states of uniformly chaotic finite-range lattice models.

Autoren: Gayral, Léo Sablik, Mathieu Taati, Siamak

Quelle: Nonlinearity; Jul2025, Vol. 38 Issue 7, p1-66, 66p

Schlagwörter: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws