Suchergebnisse - ((abstract OR abstrakty) OR abstracts) AND automation computability AND recursion theory*

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

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

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

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

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

Intensional Kleene and Rice Theorems for Abstract Program Semantics

Autoren: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng

Index Begriffe: Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, text

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

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

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

Abstract geometrical computation 12: generating representation of infinite countable linear orderings.

Autoren: Durand-Lose, Jérôme

Quelle: Natural Computing; Mar2025, Vol. 24 Issue 1, p67-78, 12p

Schlagwörter: LINEAR orderings, TURING machines, REAL numbers, MACHINERY

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

Computability Theory & Automata Theory

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

Two new proof techniques for investigating the computational power of two-way computing devices. (Abstract of thesis)

Autoren: Ďuriš, P.

Schlagwörter: two-way deterministic pushdown automata, Complexity of computation (including implicit computational complexity), Turing machines with two read heads, two-way deterministic counter automata, Analysis of algorithms and problem complexity, Formal languages and automata, Models of computation (Turing machines, etc.), Computability and recursion theory on ordinals, admissible sets, etc

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4117867

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

Autoren: Antonelli, Melissa

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

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

Cancellation rules and extended word problems

Autoren: Friedrich Otto Ronald V. Book

Quelle: Information Processing Letters. 20:5-11

Schlagwörter: Communication, information, congruences, Church-Rosser property, cancellation rules, Formal languages and automata, security, two-party protocols, 0102 computer and information sciences, 02 engineering and technology, Thue and Post systems, etc, 01 natural sciences, extended word problem, polynomial-time algorithms, nondeterministic finite state acceptor, 0202 electrical engineering, electronic engineering, information engineering, Thue systems, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/002001908590122X
https://dblp.uni-trier.de/db/journals/ipl/ipl20.html#BookO85
https://doi.org/10.1016/0020-0190(85)90122-X

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

Confluent and Other Types of Thue Systems: Confluent and other types of Thue systems

Autoren: Ronald V. Book

Quelle: Journal of the ACM. 29:171-182

Schlagwörter: Church-Rosser system, confluent systems, Formal languages and automata, 0102 computer and information sciences, Thue and Post systems, etc, preperfect system, deterministic context-free language, 01 natural sciences, word problems, Thue congruence, Decidability of theories and sets of sentences, 0101 mathematics, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jacm/jacm29.html#Book82
https://doi.acm.org/10.1145/322290.322301
https://dl.acm.org/doi/10.1145/322290.322301