Search Results - abstract and automation computability and recursion theory*
-
1
Authors:
Source: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p
Subject Terms: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES
-
2
Authors: Kulyukin, Vladimir A.
Source: Mathematics (2227-7390); Mar2025, Vol. 13 Issue 6, p934, 36p
Subject Terms: RECURSION theory, REAL numbers, COMPUTABLE functions, NUMBER theory, DATA structures
-
3
Authors: et al.
Contributors: et al.
Subject Terms: Computability Theory, Recursive Function, Rice’s Theorem, Kleene’s Second Recursion Theorem, Program Analysis, Affine Program Invariants
File Description: 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
-
4
Authors:
Contributors:
Source: Mathematical Logic Quarterly. 38:349-359
Subject Terms: 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
File Description: application/xml; application/pdf; STAMPA
-
5
Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p
Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY
-
6
Authors:
Resource Type: eBook.
Subjects: Computer science, Computable functions, Machine theory
Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity
-
7
Authors: Mundici, Daniele
Source: Transactions of the American Mathematical Society. 356:1937-1955
Subject Terms: 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
File Description: application/xml
Access 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 -
8
Authors: W. Richard Stark
Source: International Journal of Computer & Information Sciences. 13:219-236
Subject Terms: 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
File Description: application/xml
-
9
Authors: Bajrasheva, V. R.
Subject Terms: 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
File Description: application/xml
Access URL: https://zbmath.org/3904569
-
10
Authors: Yamakami, Tomoyuki
Source: Mathematical Structures in Computer Science; Nov2024, Vol. 34 Issue 10, p710-745, 36p
Subject Terms: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS
-
11
Authors:
Source: Information Processing Letters. 20:5-11
Subject Terms: 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
File Description: application/xml
-
12
Authors:
Source: Information and Computation. 289:104953
Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, F.1.1, F.3.1, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Logic in Computer Science (cs.LO)
Access URL: http://arxiv.org/abs/2105.14579
-
13
Authors: Ďuriš, P.
Subject Terms: two-way deterministic pushdown automata, Complexity of computation (including implicit computational complexity), Turing machines with two read heads, two-way deterministic counter automata, Analysis of algorithms and problem complexity, Formal languages and automata, Models of computation (Turing machines, etc.), Computability and recursion theory on ordinals, admissible sets, etc
File Description: application/xml
Access URL: https://zbmath.org/4117867
-
14
Authors:
Source: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p
Subject Terms: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic
-
15
Authors: Ronald V. Book
Source: Journal of the ACM. 29:171-182
Subject Terms: Church-Rosser system, confluent systems, Formal languages and automata, 0102 computer and information sciences, Thue and Post systems, etc, preperfect system, deterministic context-free language, 01 natural sciences, word problems, Thue congruence, Decidability of theories and sets of sentences, 0101 mathematics, Word problems, etc. in computability and recursion theory, Abstract data types, algebraic specification
File Description: application/xml
-
16
Authors:
Source: Calcolo. 15:381-394
Subject Terms: 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
File Description: application/xml
-
17
Authors:
Source: International Journal of Algebra and Computation. 10:539-589
Subject Terms: 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
File Description: application/xml
-
18
Authors: Ganesh Gopalakrishnan
Resource Type: eBook.
Categories: COMPUTERS / General, COMPUTERS / Programming / Games, COMPUTERS / Information Theory, MATHEMATICS / General, MATHEMATICS / Combinatorics, TECHNOLOGY & ENGINEERING / Engineering (General)
-
19
Authors:
Source: Nonlinearity; Jul2025, Vol. 38 Issue 7, p1-66, 66p
Subject Terms: CHAOS theory, TOPOLOGICAL property, BOLTZMANN factor, TOPOLOGICAL spaces, THERMODYNAMIC laws
-
20
Authors: et al.
Source: Theoretical Computer Science. Mar2025, Vol. 1032, pN.PAG-N.PAG. 1p.
Subject Terms: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION
Nájsť tento článok vo Web of Science 
Full Text Finder