Výsledky vyhledávání - ((abstracts OR abstrakty) OR abstractss) and automation computability and recursion theory*

On Strong and Weak Logics for Paraconsistent Computability.

Autoři: Weber, Zach Cano-Jorge, Fernando

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

Témata: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

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

Autoři: Kulyukin, Vladimir A.

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

Témata: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

Computable classifications of continuous, transducer, and regular functions.

Autoři: Franklin, Johanna N.Y. Hölzl, Rupert Melnikov, Alexander a další

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

Témata: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION

A Rice’s Theorem for Abstract Semantics

Autoři: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng a další

Přispěvatelé: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng a další

Témata: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants

Popis souboru: 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

Dostupnost: 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.

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

Témata: TURING machines, RECURSION theory, DENSITY, MACHINERY

Computability Theory & Automata Theory

Autoři: Kristy Plante Tomas Jensen

Resource Type: eBook.

Témata: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

Autoři: Qiu, Siyuan Xu, Jianfeng

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

Témata: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

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

Autoři: Yamakami, Tomoyuki

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

Témata: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

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

Autoři: Gayral, Léo Sablik, Mathieu Taati, Siamak

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

Témata: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws

COMPARING COMPUTABILITY IN TWO TOPOLOGIES.

Autoři: AMIR, DJAMEL EDDINE HOYRUP, MATHIEU

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

Témata: TOPOLOGICAL spaces, POINT set theory, TOPOLOGY

Automata and Computability : A Programmer's Perspective

Autoři: Ganesh Gopalakrishnan

Resource Type: eBook.

Témata: 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.

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

Témata: 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

Autoři: Mundici, Daniele

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Autoři: Paolo Baldan Francesco Ranzato Linpeng Zhang

Zdroj: Information and Computation. 289:104953

Témata: 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)

Přístupová URL adresa: http://arxiv.org/abs/2105.14579

Recursion in programs, thought, and language.

Autoři: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert a další

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

Témata: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

A glimpse into the paradise of combinatory algebra

Autoři: W. Richard Stark

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

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

Autoři: Paul J. Sanders David B. A. Epstein

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

Chair of Mathematical Logic and Theory of Algorithms.

Autoři: Semenov, A. L. Babenko, M. A. Belov, A. Ya. a další

Zdroj: Moscow University Mathematics Bulletin; Feb2025, Vol. 80 Issue 1, p23-33, 11p

Degrees of automata transformations

Autoři: Bajrasheva, V. R.

Témata: category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3904569

Cancellation rules and extended word problems

Autoři: Friedrich Otto Ronald V. Book

Zdroj: Information Processing Letters. 20:5-11

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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