Search Results - abstract and ((automatic OR automatizace) OR 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.
Source: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p
Subject Terms: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory
-
4
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
-
5
Authors:
Resource Type: eBook.
Subjects: Computer science, Computable functions, Machine theory
Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity
-
6
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
-
7
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
-
8
Source: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p
Subject Terms: TURING machines, RECURSION theory, DENSITY, MACHINERY
-
9
Authors: et al.
Source: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p
Subject Terms: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory
-
10
Authors: G. Ausiello
Source: Calcolo. 5:174-184
Subject Terms: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)
File Description: application/xml
-
11
Authors: Pitts, Andrew M.
Source: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p
Subject Terms: PERMUTATIONS, RECURSION theory, MATHEMATICAL induction, FINITE element method, COMPUTER programming
-
12
Authors:
Source: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p
-
13
Authors: et al.
Source: ACM Transactions on Computational Logic; Jul2017, Vol. 18 Issue 3, p1-42, 42p
Subject Terms: RECURSION theory, INFINITY (Mathematics), MACHINE theory, GRAPH theory, RANKING (Statistics)
-
14
Authors: et al.
Source: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p
-
15
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
-
16
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 -
17
Authors:
-
18
-
19
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
-
20
Authors:
Source: Frontiers in Psychology; 3/31/2016, p1-21, 21p
Nájsť tento článok vo Web of Science 
Full Text Finder 
Full Text