Suchergebnisse - (abstract OR astrally) and automation computability and recursion theory

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

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

Simple Bratteli diagrams with a Gödel-incomplete C*-equivalence problem

Autoren: Mundici, Daniele

Quelle: Transactions of the American Mathematical Society. 356:1937-1955

Schlagwörter: Applied Mathematics, General Mathematics, Elliott's classification, \(C^*\)-equivalence, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Ordered abelian groups, Riesz groups, ordered linear spaces, 01 natural sciences, De Concini-Procesi theorem for toric varieties, Classifications of \(C^*\)-algebras, Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry), stable AF-algebra, isomorphism of Bratteli diagrams, Markov undecidability theorem, 0101 mathematics, Word problems, etc. in computability and recursion theory

Dateibeschreibung: application/xml

Zugangs-URL: https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://zbmath.org/2041166
https://doi.org/10.1090/s0002-9947-03-03353-1
https://www.ams.org/tran/2004-356-05/S0002-9947-03-03353-1/S0002-9947-03-03353-1.pdf
https://www.ams.org/journals/tran/2004-356-05/S0002-9947-03-03353-1/home.html
https://www.openaccessrepository.it/record/207804

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

Degrees of automata transformations

Autoren: Bajrasheva, V. R.

Schlagwörter: category methods in recursion theory, Other degrees and reducibilities in computability and recursion theory, Formal languages and automata, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, complete degrees

Dateibeschreibung: application/xml

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

Cancellation rules and extended word problems

Autoren: Friedrich Otto Ronald V. Book

Quelle: Information Processing Letters. 20:5-11

Schlagwörter: Communication, information, congruences, Church-Rosser property, cancellation rules, Formal languages and automata, security, two-party protocols, 0102 computer and information sciences, 02 engineering and technology, Thue and Post systems, etc, 01 natural sciences, extended word problem, polynomial-time algorithms, nondeterministic finite state acceptor, 0202 electrical engineering, electronic engineering, information engineering, Thue systems, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/002001908590122X
https://dblp.uni-trier.de/db/journals/ipl/ipl20.html#BookO85
https://doi.org/10.1016/0020-0190(85)90122-X

Recursivite et cones rationnels fermes par intersection: Recursivite et cônes rationnels fermés par intersection

Autoren: M. Latteux A. Arnold

Quelle: Calcolo. 15:381-394

Schlagwörter: semi-Dyck language, decidability, 0202 electrical engineering, electronic engineering, information engineering, quasi-commutative grammars, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, abstract families of languages, rational cones, recursive languages, Word problems, etc. in computability and recursion theory, reachability problem in vector-addition systems, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/BF02576519.pdf
https://link.springer.com/article/10.1007/BF02576519

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

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

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

A generalization of the notions of a machine and computability

Autoren: W. Żakowski

Quelle: Information and Control. 33:166-176

Schlagwörter: Analysis of algorithms and problem complexity, Formal languages and automata, 0101 mathematics, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc, Engineering(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/iandc/iandc33.html#Zakowski77
https://www.sciencedirect.com/science/article/abs/pii/S0019995877905526
https://www.sciencedirect.com/science/article/pii/S0019995877905526

Intensional Kleene and Rice Theorems for Abstract Program Semantics

Autoren: Baldan, Paolo Ranzato, Francesco Zhang, Linpeng

Index Begriffe: Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, text

URL: http://arxiv.org/abs/2105.14579

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

Combinatory structures

Autoren: Petrov, Veselin P. Skordev, Dimit'r G.

Schlagwörter: Ordered structures, additional algebraic structure, normal form theorem for recursive morphisms, branching, Categories of machines, automata, Categorical structures, iteration, Abstract and axiomatic computability and recursion theory, recursiveness, partially ordered categories

Dateibeschreibung: application/xml

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

ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION: On a simple combinatorial structure sufficient for syblying nontrivial self-reproduction

Autoren: Lutz Priese

Quelle: Journal of Cybernetics. 6:101-137

Schlagwörter: 0301 basic medicine, 03 medical and health sciences, Applications of computability and recursion theory, Formal languages and automata, 0102 computer and information sciences, Thue and Post systems, etc, Automata and formal grammars in connection with logical questions, 01 natural sciences, General biology and biomathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://www.tandfonline.com/doi/abs/10.1080/01969727608927527

Computability Theory & Automata Theory

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

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

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