Výsledky vyhledávání - (abstract OR abstrakty) and automatic computability and recursion theory*
-
1
Autoři: a další
Zdroj: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p
-
2
Autoři: Astarte, Troy Kaighin
Zdroj: Philosophies; Aug2025, Vol. 10 Issue 4, p90, 22p
-
3
Autoři:
Zdroj: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p
-
4
Autoři:
Zdroj: Mathematical Structures in Computer Science; Sep2025, Vol. 34 Issue 7, p747-806, 60p
-
5
Autoři: a další
Zdroj: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p
-
6
Autoři:
Zdroj: Sankhya A; Aug2025, Vol. 87 Issue 2, p349-377, 29p
-
7
Autoři: Pitts, Andrew M.
Zdroj: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p
-
8
Autoři:
Zdroj: International Journal of Algebra and Computation. 10:539-589
Témata: 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
Popis souboru: application/xml
-
9
Autoři: Lane, Patricia A.
Zdroj: Mathematics (2227-7390); Nov2024, Vol. 12 Issue 22, p3529, 29p
-
10
Autoři:
Zdroj: Entropy; Jan2025, Vol. 27 Issue 1, p90, 54p
-
11
Autoři: a další
Zdroj: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p
-
12
Autoři:
Zdroj: International Journal of Parallel, Emergent & Distributed Systems; Jan2025, Vol. 40 Issue 1, p21-58, 38p
-
13
Autoři:
Zdroj: Fundamenta Informaticae; 2005, Vol. 67 Issue 4, p377-419, 43p, 22 Charts
-
14
-
15
Zdroj: Oberwolfach Reports; 2021, p1693-1757, 65p
-
16
Autoři: G. Ausiello
Zdroj: Calcolo. 5:174-184
Témata: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064 -
17
Autoři: Wolter, Uwe
Zdroj: Logics; Sep2025, Vol. 3 Issue 3, p8, 40p
-
18
Autoři: a další
Zdroj: Cryptography (2410-387X); Mar2025, Vol. 9 Issue 1, p16, 26p
-
19
Autoři:
Zdroj: Computability; 2022, Vol. 11 Issue 3/4, p241-267, 27p
Témata: COMPUTABLE functions, RECURSION theory
-
20
Zdroj: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p547-579, 33p
Nájsť tento článok vo Web of Science
Full Text Finder