Search Results - abstracts and ((automatizace 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

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

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

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

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)

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

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

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

Authors: Yamakami, Tomoyuki

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

Subject Terms: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

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

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

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

Subject Terms: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws

Automata Theory : An Algorithmic Approach

Authors: Javier Esparza Michael Blondin

Resource Type: eBook.

Subjects: Machine theory

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / General

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 ROBUST GRAPH-BASED APPROACH TO OBSERVATIONAL EQUIVALENCE.

Authors: GHICA, DAN R. KOKO MUROYA WAUGH AMBRIDGE, TODD

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 2, p1-95, 95p

Subject Terms: MACHINE theory, NEIGHBORHOODS, GEOMETRY, MACHINERY

Towards a Logical Foundation of Randomized Computation: Doctoral Thesis Abstract.

Authors: Antonelli, Melissa

Source: KI: Künstliche Intelligenz; Aug2024, Vol. 38 Issue 1/2, p99-105, 7p

Computability, Notation, and de re Knowledge of Numbers.

Authors: Shapiro, Stewart Snyder, Eric Samuels, Richard

Source: Philosophies; Mar2022, Vol. 7 Issue 1, p1-10, 10p

Subject Terms: COMPUTABILITY logic, THEORY of knowledge, PHILOSOPHY

People: KRIPKE, Saul A., 1940-2022, TURING, Alan Mathison, 1912-1954

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

Language Is a "Quite Useless" Tool: A Rejoinder to Fedorenko, Piantadosi, and Gibson's "Language Is Primarily a Tool for Communication Rather Than Thought".

Authors: Watumull, Jeffrey

Source: Biolinguistics; 2024, Vol. 18, p1-41, 41p

Subject Terms: PROOF theory, PLATONISTS, RATIONALISM, LANGUAGE & languages, AESTHETICS

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