Výsledky vyhľadávania - (abstract OR abstracts) and (automatic OR automation) computability and recursion theory

A Rice’s Theorem for Abstract Semantics

Autori: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng a ďalší

Prispievatelia: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng a ďalší

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

Popis súboru: 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

Dostupnosť: 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.

Autori: 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

Predmety: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

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

Autori: Kulyukin, Vladimir A.

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

Predmety: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures

A pathological punctually 1-decidable structure.

Autori: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. a ďalší

Zdroj: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p

Predmety: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

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

Autori: Paul J. Sanders David B. A. Epstein

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

Predmety: 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 súboru: application/xml

Prí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

Computability Theory & Automata Theory

Autori: Kristy Plante Tomas Jensen

Typ zdroja: eBook.

Predmet: Computer science, Computable functions, Machine theory

Kategórie: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

Autori: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Prispievatelia: Caterina Bianchini Andrea Sorbi Sorbi, Andrea

Zdroj: Mathematical Logic Quarterly. 38:349-359

Predmety: 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 súboru: application/xml; application/pdf; STAMPA

Prí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

Alpha-Structural Recursion and Induction.

Autori: Pitts, Andrew M.

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

Predmety: PERMUTATIONS, RECURSION theory, MATHEMATICAL induction, FINITE element method, COMPUTER programming

Countability constraints in order-theoretic approaches to computability.

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

Predmety: TURING machines, RECURSION theory, DENSITY, MACHINERY

Intensional Kleene and Rice Theorems for Abstract Program Semantics

Autori: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng

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

Recursion in programs, thought, and language.

Autori: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert a ďalší

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

Predmety: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

Automatic reduction of cuch expression by means of the value method: Automatic reduction of CUCH expression by means of the value method

Autori: G. Ausiello

Zdroj: Calcolo. 5:174-184

Predmety: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064

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

Autori: Ďuriš, P.

Predmety: 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 súboru: application/xml

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

A glimpse into the paradise of combinatory algebra

Autori: W. Richard Stark

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

Predmety: 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 súboru: application/xml

Prí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

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

Autori: Oettinger, A. G. Fischer, Patrick C.

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

Predmety: TURING machines, SEQUENTIAL machine theory, COMPUTATIONAL linguistics, RECURSION theory, MACHINE theory, ALGORITHMS

Collapsible Pushdown Automata and Recursion Schemes.

Autori: HAGUE, MATTHEW MURAWSKI, ANDRZEJ S. ONG, C.-H. LUKE a ďalší

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

Predmety: RECURSION theory, INFINITY (Mathematics), MACHINE theory, GRAPH theory, RANKING (Statistics)

A Survey of Nature-Inspired Computing: Membrane Computing.

Autori: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a ďalší

Zdroj: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p

Predmety: COMPUTATIONAL complexity, NP-complete problems, RECURSION theory, CELL anatomy, COMPUTER systems, BIOLOGICALLY inspired computing

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

Autori: Ronald V. Book

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

Predmety: 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 súboru: application/xml

Prí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

Autori: Friedrich Otto Ronald V. Book

Zdroj: Information Processing Letters. 20:5-11

Predmety: 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 súboru: application/xml

Prí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

Autori: M. Latteux A. Arnold

Zdroj: Calcolo. 15:381-394

Predmety: 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 súboru: application/xml

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