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

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

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

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

Automatic differentiation for ML-family languages: Correctness via logical relations.

Autoren: Lucatelli Nunes, Fernando Vákár, Matthijs

Quelle: Mathematical Structures in Computer Science; Sep2025, Vol. 34 Issue 7, p747-806, 60p

Schlagwörter: PROGRAMMING language semantics, LOGIC, PROGRAM transformation, AUTOMATIC differentiation, PROGRAMMING languages

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

Probabilities on Cones of Multimatrix Variate Distributions and Elliptical Affine Shape Distributions Under Real Normed Division Algebras.

Autoren: Caro-Lopera, Francisco J. Díaz-García, José A.

Quelle: Sankhya A; Aug2025, Vol. 87 Issue 2, p349-377, 29p

Alpha-Structural Recursion and Induction.

Autoren: Pitts, Andrew M.

Quelle: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p

Schlagwörter: PERMUTATIONS, RECURSION theory, MATHEMATICAL induction, FINITE element method, COMPUTER programming

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

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

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

A Survey of Nature-Inspired Computing: Membrane Computing.

Autoren: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID et al.

Quelle: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p

Schlagwörter: COMPUTATIONAL complexity, NP-complete problems, RECURSION theory, CELL anatomy, COMPUTER systems, BIOLOGICALLY inspired computing

Exploring the philosophical perspectives of future robots.

Autoren: Guilherme, Anthony Costa, José Félix

Quelle: International Journal of Parallel, Emergent & Distributed Systems; Jan2025, Vol. 40 Issue 1, p21-58, 38p

Schlagwörter: PHILOSOPHY of science, SCIENTIFIC method, ARTIFICIAL intelligence, PRINCIPLE (Philosophy), MACHINE learning

First and Second Order Recursion on Abstract Data Types.

Autoren: Jian Xu Zucker, Jeffery

Quelle: Fundamenta Informaticae; 2005, Vol. 67 Issue 4, p377-419, 43p, 22 Charts

Schlagwörter: ALGEBRA, MATHEMATICS, FIXED point theory, NONLINEAR operators, COINCIDENCE theory, ABSTRACT data types (Computer science), COMPUTER programming

Computability Theory & Automata Theory

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

Mathematical Logic: Proof Theory, Constructive Mathematics (hybrid meeting).

Quelle: Oberwolfach Reports; 2021, p1693-1757, 65p

Schlagwörter: MATHEMATICAL logic, ABSTRACT algebra, PROOF theory, LOGIC, COMPUTATIONAL mechanics

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

Logics of Statements in Context—First-Order Logic Files.

Autoren: Wolter, Uwe

Quelle: Logics; Sep2025, Vol. 3 Issue 3, p8, 40p

Schlagwörter: FIRST-order logic, LOGIC, MATHEMATIC morphism, MATHEMATICAL logic, MATHEMATICAL formulas, PREDICATE (Logic), GROTHENDIECK groups

Construction of Countably Infinite Programs That Evade Malware/Non-Malware Classification for Any Given Formal System †.

Autoren: Liagkou, Vasiliki Nastou, Panagiotis E. Spirakis, Paul et al.

Quelle: Cryptography (2410-387X); Mar2025, Vol. 9 Issue 1, p16, 26p

Schlagwörter: MALWARE, ANTI-malware (Computer software), TURING machines, INTERNET security, CLASSIFICATION algorithms

Extending properly n-REA sets¹.

Autoren: Cholak, Peter Gerdes, Peter

Quelle: Computability; 2022, Vol. 11 Issue 3/4, p241-267, 27p

Schlagwörter: COMPUTABLE functions, RECURSION theory

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