Výsledky vyhľadávania - (abstract OR abstraktu) AND automatic computability AND recursion theory~
-
1
Autori: a ďalší
Zdroj: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p
-
2
Autori: a ďalší
Zdroj: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p
-
3
Autori: Pitts, Andrew M.
Zdroj: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p
-
4
Autori:
Zdroj: International Journal of Algebra and Computation. 10:539-589
Predmety: 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 súboru: application/xml
-
5
Autori: a ďalší
Zdroj: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p
-
6
Autori:
Typ zdroja: eBook.
Predmet: Computer science, Computable functions, Machine theory
Kategórie: MATHEMATICS / Logic, MATHEMATICS / Infinity
-
7
Autori: G. Ausiello
Zdroj: Calcolo. 5:174-184
Predmety: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)
Popis súboru: application/xml
Prístupová URL adresa: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064 -
8
Autori:
Zdroj: Computability; 2022, Vol. 11 Issue 3/4, p241-267, 27p
Predmety: COMPUTABLE functions, RECURSION theory
-
9
-
10
Autori: a ďalší
Zdroj: Brain Informatics; 6/7/2023, Vol. 10 Issue 1, p1-15, 15p
Predmety: ELECTROENCEPHALOGRAPHY, ALPHA rhythm, PROBABILITY theory
-
11
Autori: Lawrence C. Paulson
Zdroj: Science of Computer Programming. 3:119-149
Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 0102 computer and information sciences, 02 engineering and technology, logic of computable functions, Symbolic computation and algebraic computation, formula conversions, ML, 01 natural sciences, Computability and recursion theory on ordinals, admissible sets, etc, Logic in Computer Science (cs.LO), implementation of rewriting in LCF, pattern matching, term conversions, D.1.1, D.2.4, F.4.1, 0202 electrical engineering, electronic engineering, information engineering, Software, Theorem proving (deduction, resolution, etc.), Abstract data types, algebraic specification
Popis súboru: application/xml
Prístupová URL adresa: http://arxiv.org/abs/cs/9301108
https://core.ac.uk/display/81958412
http://ui.adsabs.harvard.edu/abs/1993cs........1108P/abstract
https://dblp.uni-trier.de/db/journals/scp/scp3.html#Paulson83
http://doi.org/10.1016/0167-6423(83)90008-4
http://www.sciencedirect.com/science/article/pii/0167642383900084
https://doi.org/10.1016/0167-6423(83)90008-4 -
12
Autori:
Zdroj: Frontiers in Psychology; 3/31/2016, p1-21, 21p
-
13
Autori: a ďalší
Zdroj: ACM Transactions on Computational Logic; Jul2017, Vol. 18 Issue 3, p1-42, 42p
-
14
Autori: Kenneth J. Supowit
Typ zdroja: eBook.
Predmet: Computer science, Computable functions, Recursion theory, Set theory, Computer science—Mathematics
Kategórie: COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Logic, MATHEMATICS / Set Theory
-
15
Autori: Andrea Sorbi
Typ zdroja: eBook.
Predmet: Recursion theory, Computational complexity
Kategórie: MATHEMATICS / General, MATHEMATICS / Applied
-
16
Autori:
Zdroj: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p
-
17
-
18
Autori: Cyrus F. Nourani
Typ zdroja: eBook.
Kategórie: MATHEMATICS / Algebra / General, MATHEMATICS / Geometry / General, MATHEMATICS / Set Theory
-
19
-
20
Autori: Guallart, Nino
Zdroj: Axiomathes: Global Philosophy; Mar2015, Vol. 25 Issue 1, p61-77, 17p
Nájsť tento článok vo Web of Science
Full Text Finder