Výsledky vyhledávání - abstract and (automatizace OR 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

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

Autoři: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Přispěvatelé: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Zdroj: Mathematical Logic Quarterly. 38:349-359

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

Popis souboru: application/xml; application/pdf; STAMPA

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

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

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

Alpha-Structural Recursion and Induction.

Autoři: Pitts, Andrew M.

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

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

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

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

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

Autoři: Ronald V. Book

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

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

Popis souboru: application/xml

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

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

Recursivite et cones rationnels fermes par intersection: Recursivite et cônes rationnels fermés par intersection

Autoři: M. Latteux A. Arnold

Zdroj: Calcolo. 15:381-394

Témata: semi-Dyck language, decidability, 0202 electrical engineering, electronic engineering, information engineering, quasi-commutative grammars, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, abstract families of languages, rational cones, recursive languages, Word problems, etc. in computability and recursion theory, reachability problem in vector-addition systems, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007/BF02576519.pdf
https://link.springer.com/article/10.1007/BF02576519

Collapsible Pushdown Automata and Recursion Schemes.

Autoři: HAGUE, MATTHEW MURAWSKI, ANDRZEJ S. ONG, C.-H. LUKE a další

Zdroj: ACM Transactions on Computational Logic; Jul2017, Vol. 18 Issue 3, p1-42, 42p

Témata: RECURSION theory, INFINITY (Mathematics), MACHINE theory, GRAPH theory, RANKING (Statistics)

Intensional Kleene and Rice Theorems for Abstract Program Semantics

Autoři: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng

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

Multi-Tape and Infinite-State Automata--A Survey.

Autoři: Oettinger, A. G. Fischer, Patrick C.

Zdroj: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p

Témata: TURING machines, SEQUENTIAL machine theory, COMPUTATIONAL linguistics, RECURSION theory, MACHINE theory, ALGORITHMS

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

Autoři: Ďuriš, P.

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

Popis souboru: application/xml

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