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

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

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

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

Computable classifications of continuous, transducer, and regular functions.

Autori: Franklin, Johanna N.Y. Hölzl, Rupert Melnikov, Alexander a ďalší

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

Predmety: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION

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

Autori: Bunder, M. W.

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

Popis súboru: application/xml

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

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

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

Aspects Of Computation And Automata Theory With Applications

Autori: Noam Greenberg Sanjay Jain Keng Meng Ng a ďalší

Typ zdroja: eBook.

Predmet: Machine theory, Computational complexity, Recursion theory

Kategórie: MATHEMATICS / Logic, MATHEMATICS / Applied, MATHEMATICS / Discrete Mathematics

Computability

Autori: George Tourlakis

Typ zdroja: eBook.

Predmet: Computable functions, Recursion theory, Computational complexity, Computer science, Technology—Philosophy

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

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

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

From Fieldwork to Linguistic Theory

Autori: Gibson, Edward Poliak, Moshe

Typ zdroja: eBook.

Kategórie: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

Complexity, Logic, and Recursion Theory

Autori: Andrea Sorbi

Typ zdroja: eBook.

Predmet: Recursion theory, Computational complexity

Kategórie: MATHEMATICS / General, MATHEMATICS / Applied

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

Computational Power of Infinite Quantum Parallelism.

Autori: Ziegler, Martin

Zdroj: International Journal of Theoretical Physics; Nov2005, Vol. 44 Issue 11, p2059-2071, 13p, 1 Diagram

Predmety: QUANTUM theory, RECURSION theory, TURING machines, QUANTUM computers, MACHINE theory, MATHEMATICAL logic

DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY.

Autori: Byerly, Robert E.

Zdroj: Mathematical Logic Quarterly; 1984, Vol. 30 Issue 32-34, p499-503, 5p

Predmety: COMPUTATIONAL complexity, NP-complete problems, MACHINE theory, PERMUTATIONS, RECURSION theory, MATHEMATICAL logic

Higher Recursion Theory And Set Theory

Autori: James Cummings Andrew Marks Yue Yang a ďalší

Typ zdroja: eBook.

Predmet: Recursion theory, Set theory

Kategórie: MATHEMATICS / Set Theory, MATHEMATICS / Logic

Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II

Autori: Naoki Kobayashi James Worrell

Typ zdroja: eBook.

Predmet: Computer software--Congresses, Software engineering--Congresses

Kategórie: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic

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

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