Výsledky vyhledávání - abstracts and (automatizacia 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

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

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

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

Automata and Computability : A Programmer's Perspective

Autoři: Ganesh Gopalakrishnan

Resource Type: eBook.

Témata: Digital control systems--Programming, Automatic control--Data processing, Machine theory

Categories: COMPUTERS / General, COMPUTERS / Programming / Games, COMPUTERS / Information Theory, MATHEMATICS / General, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Engineering (General)

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

How much partiality is needed for a theory of computability?

Autoři: Spreen, Dieter

Zdroj: Computability; 2023, Vol. 12 Issue 4, p371-426, 56p

Témata: COMPUTABLE functions, NATURAL numbers, NUMBER concept, NUMBER theory

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

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

Autoři: Bunder, M. W.

Témata: 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 souboru: application/xml

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

Automata Theory : An Algorithmic Approach

Autoři: Javier Esparza Michael Blondin

Resource Type: eBook.

Témata: Machine theory

Categories: COMPUTERS / Programming / Algorithms, COMPUTERS / Computer Science, COMPUTERS / Software Development & Engineering / General

Computability, Notation, and de re Knowledge of Numbers.

Autoři: Shapiro, Stewart Snyder, Eric Samuels, Richard

Zdroj: Philosophies; Mar2022, Vol. 7 Issue 1, p1-10, 10p

Témata: COMPUTABILITY logic, THEORY of knowledge, PHILOSOPHY

People: KRIPKE, Saul A., 1940-2022, TURING, Alan Mathison, 1912-1954

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

Research on a General State Formalization Method from the Perspective of Logic.

Autoři: Qiu, Siyuan Xu, Jianfeng

Zdroj: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p

Témata: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

Towards a Logical Foundation of Randomized Computation: Doctoral Thesis Abstract.

Autoři: Antonelli, Melissa

Zdroj: KI: Künstliche Intelligenz; Aug2024, Vol. 38 Issue 1/2, p99-105, 7p

Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions.

Autoři: Yamakami, Tomoyuki

Zdroj: Mathematical Structures in Computer Science; Nov2024, Vol. 34 Issue 10, p710-745, 36p

Témata: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

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

Formalization of the Computational Theory of a Turing Complete Functional Language Model.

Autoři: Ramos, Thiago Mendonça Ferreira Almeida, Ariane Alves Ayala-Rincón, Mauricio

Zdroj: Journal of Automated Reasoning; Nov2022, Vol. 66 Issue 4, p1031-1063, 33p

Témata: COMPUTABLE functions, MODEL theory, RECURSIVE functions

Characterisation of the set of ground states of uniformly chaotic finite-range lattice models.

Autoři: Gayral, Léo Sablik, Mathieu Taati, Siamak

Zdroj: Nonlinearity; Jul2025, Vol. 38 Issue 7, p1-66, 66p

Témata: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws

Language Is a "Quite Useless" Tool: A Rejoinder to Fedorenko, Piantadosi, and Gibson's "Language Is Primarily a Tool for Communication Rather Than Thought".

Autoři: Watumull, Jeffrey

Zdroj: Biolinguistics; 2024, Vol. 18, p1-41, 41p

Témata: PROOF theory, PLATONISTS, RATIONALISM, LANGUAGE & languages, AESTHETICS