Výsledky vyhledávání - abstracts AND ((automatic OR automation) OR automatizacia) 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

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

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

A pathological punctually 1-decidable structure.

Autoři: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. a další

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

Témata: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

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

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

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

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

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

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

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

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

Autoři: G. Ausiello

Zdroj: Calcolo. 5:174-184

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

Popis souboru: application/xml

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

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

Aspects Of Computation And Automata Theory With Applications

Autoři: Noam Greenberg Sanjay Jain Keng Meng Ng a další

Resource Type: eBook.

Témata: Machine theory, Computational complexity, Recursion theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Applied, MATHEMATICS / Discrete Mathematics

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

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)

Computability

Autoři: George Tourlakis

Resource Type: eBook.

Témata: Computable functions, Recursion theory, Computational complexity, Computer science, Technology—Philosophy

Categories: COMPUTERS / Computer Science, MATHEMATICS / Logic, SCIENCE / Philosophy & Social Aspects, TECHNOLOGY & ENGINEERING / General

A Survey of Nature-Inspired Computing: Membrane Computing.

Autoři: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a další

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

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

Extending properly n-REA sets¹.

Autoři: Cholak, Peter Gerdes, Peter

Zdroj: Computability; 2022, Vol. 11 Issue 3/4, p241-267, 27p

Témata: COMPUTABLE functions, RECURSION theory

From Fieldwork to Linguistic Theory

Autoři: Gibson, Edward Poliak, Moshe

Resource Type: eBook.

Categories: LANGUAGE ARTS & DISCIPLINES / Linguistics / General