Suchergebnisse - abstracts and ((automatic OR automatizacia) OR automation) computability and recursion theory~

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

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

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

A pathological punctually 1-decidable structure.

Autoren: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. et al.

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

Schlagwörter: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

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

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

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

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

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

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

Recursion in programs, thought, and language.

Autoren: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert et al.

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

Schlagwörter: 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

Autoren: G. Ausiello

Quelle: Calcolo. 5:174-184

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

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064

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

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

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

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

Schlagwörter: TURING machines, SEQUENTIAL machine theory, COMPUTATIONAL linguistics, RECURSION theory, MACHINE theory, ALGORITHMS

Collapsible Pushdown Automata and Recursion Schemes.

Autoren: HAGUE, MATTHEW MURAWSKI, ANDRZEJ S. ONG, C.-H. LUKE et al.

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

Schlagwörter: RECURSION theory, INFINITY (Mathematics), MACHINE theory, GRAPH theory, RANKING (Statistics)

Computability

Autoren: George Tourlakis

Resource Type: eBook.

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

Autoren: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID et al.

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

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

Extending properly n-REA sets¹.

Autoren: Cholak, Peter Gerdes, Peter

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

Schlagwörter: COMPUTABLE functions, RECURSION theory

From Fieldwork to Linguistic Theory

Autoren: Gibson, Edward Poliak, Moshe

Resource Type: eBook.

Categories: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

A formal metatheory in which Goedel's first but not his second incompleteness theorem can be proved

Autoren: Bunder, M. W.

Schlagwörter: Decidability of theories and sets of sentences, metatheory, formal systems, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, Goedels incompleteness theorems

Dateibeschreibung: application/xml

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