Suchergebnisse - ((abstract OR abstrakty) OR astrakty) and automation 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

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

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

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

Computability Theory & Automata Theory

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

Autoren: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Weitere Verfasser: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Quelle: Mathematical Logic Quarterly. 38:349-359

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

Dateibeschreibung: application/xml; application/pdf; STAMPA

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

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

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

A ROBUST GRAPH-BASED APPROACH TO OBSERVATIONAL EQUIVALENCE.

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

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

Schlagwörter: MACHINE theory, NEIGHBORHOODS, GEOMETRY, MACHINERY

How much partiality is needed for a theory of computability?

Autoren: Spreen, Dieter

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

Schlagwörter: COMPUTABLE functions, NATURAL numbers, NUMBER concept, NUMBER theory

COMPARING COMPUTABILITY IN TWO TOPOLOGIES.

Autoren: AMIR, DJAMEL EDDINE HOYRUP, MATHIEU

Quelle: Journal of Symbolic Logic; Sep2024, Vol. 89 Issue 3, p1232-1250, 19p

Schlagwörter: TOPOLOGICAL spaces, POINT set theory, TOPOLOGY

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)

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

Simple Bratteli diagrams with a Gödel-incomplete C*-equivalence problem

Autoren: Mundici, Daniele

Quelle: Transactions of the American Mathematical Society. 356:1937-1955

Schlagwörter: Applied Mathematics, General Mathematics, Elliott's classification, \(C^*\)-equivalence, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Ordered abelian groups, Riesz groups, ordered linear spaces, 01 natural sciences, De Concini-Procesi theorem for toric varieties, Classifications of \(C^*\)-algebras, Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry), stable AF-algebra, isomorphism of Bratteli diagrams, Markov undecidability theorem, 0101 mathematics, Word problems, etc. in computability and recursion theory

Dateibeschreibung: application/xml

Zugangs-URL: https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://zbmath.org/2041166
https://doi.org/10.1090/s0002-9947-03-03353-1
https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://www.ams.org/journals/tran/2004-356-05/S0002-9947-03-03353-1/home.html
https://www.openaccessrepository.it/record/207804

Intensional Kleene and Rice theorems for abstract program semantics

Autoren: Paolo Baldan Francesco Ranzato Linpeng Zhang

Quelle: Information and Computation. 289:104953

Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Logic in Computer Science (cs.LO)

Zugangs-URL: http://arxiv.org/abs/2105.14579

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

A glimpse into the paradise of combinatory algebra

Autoren: W. Richard Stark

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

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

Dateibeschreibung: application/xml

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

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