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

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

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

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

Autori: Qiu, Siyuan Xu, Jianfeng

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

Predmety: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

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

Autori: Yamakami, Tomoyuki

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

Predmety: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

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

Autori: Gayral, Léo Sablik, Mathieu Taati, Siamak

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

Predmety: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws

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

A ROBUST GRAPH-BASED APPROACH TO OBSERVATIONAL EQUIVALENCE.

Autori: GHICA, DAN R. KOKO MUROYA WAUGH AMBRIDGE, TODD

Zdroj: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 2, p1-95, 95p

Predmety: MACHINE theory, NEIGHBORHOODS, GEOMETRY, MACHINERY

2024 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Iowa State University Ames, IA, USA May 14–17, 2024.

Zdroj: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p547-579, 33p

Predmety: DISCRETE mathematics, MATHEMATICAL logic, PROBABILISTIC automata, PHILOSOPHY of science, MATHEMATICAL equivalence, KOLMOGOROV complexity, COMPUTABLE functions, BIPARTITE graphs, TOPOLOGICAL groups

COMPARING COMPUTABILITY IN TWO TOPOLOGIES.

Autori: AMIR, DJAMEL EDDINE HOYRUP, MATHIEU

Zdroj: Journal of Symbolic Logic; Sep2024, Vol. 89 Issue 3, p1232-1250, 19p

Predmety: TOPOLOGICAL spaces, POINT set theory, TOPOLOGY

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

How much partiality is needed for a theory of computability?

Autori: Spreen, Dieter

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

Predmety: COMPUTABLE functions, NATURAL numbers, NUMBER concept, NUMBER theory

Automata and Computability : A Programmer's Perspective

Autori: Ganesh Gopalakrishnan

Typ zdroja: eBook.

Predmet: Digital control systems--Programming, Automatic control--Data processing, Machine theory

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

Recursion : A Computational Investigation Into the Representation and Processing of Language

Autori: David J. Lobina

Typ zdroja: eBook.

Predmet: Computational linguistics, Linguistic analysis (Linguistics), Natural language processing (Computer science), Recursion theory

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

Graph-Based Automation of Threat Analysis and Risk Assessment for Automotive Security.

Autori: Saulaiman, Mera Nizam-Edden Kozlovszky, Miklos Csilling, Akos

Zdroj: Information; Jun2025, Vol. 16 Issue 6, p449, 38p

Predmety: INFORMATION technology, FINITE state machines, DATABASES, RISK assessment, PATH analysis (Statistics), CYBER physical systems

Chair of Mathematical Logic and Theory of Algorithms.

Autori: Semenov, A. L. Babenko, M. A. Belov, A. Ya. a ďalší

Zdroj: Moscow University Mathematics Bulletin; Feb2025, Vol. 80 Issue 1, p23-33, 11p

Structured Dynamics in the Algorithmic Agent.

Autori: Ruffini, Giulio Castaldo, Francesca Vohryzek, Jakub

Zdroj: Entropy; Jan2025, Vol. 27 Issue 1, p90, 54p

Predmety: COMPUTATIONAL intelligence, NOETHER'S theorem, INFORMATION theory, GROUP theory, KOLMOGOROV complexity, MIRROR neurons

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