Suchergebnisse - ((abstract OR abstrakty) OR abstraktys) AND automation computability AND recursion theory~
-
1
Autoren: et al.
Quelle: Theoretical Computer Science. Mar2025, Vol. 1032, pN.PAG-N.PAG. 1p.
Schlagwörter: *RECURSION theory, *BANACH spaces, *CONTINUOUS functions, *TRANSDUCERS, *CLASSIFICATION
-
2
Autoren:
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
-
3
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
-
4
Autoren: et al.
Weitere Verfasser: 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
-
5
Quelle: Mathematical Structures in Computer Science; Jun2024, Vol. 34 Issue 6, p1-38, 38p
Schlagwörter: TURING machines, RECURSION theory, DENSITY, MACHINERY
-
6
Autoren:
Resource Type: eBook.
Schlagworte: Computer science, Computable functions, Machine theory
Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity
-
7
Autoren:
Weitere Verfasser:
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
-
8
Autoren: David J. Lobina
Resource Type: eBook.
Schlagworte: Computational linguistics, Linguistic analysis (Linguistics), Natural language processing (Computer science), Recursion theory
-
9
Autoren: et al.
Quelle: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p
-
10
Autoren: Pitts, Andrew M.
Quelle: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p
-
11
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 -
12
Autoren:
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
-
13
Autoren:
Quelle: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p
-
14
Autoren: et al.
Quelle: ACM Transactions on Computational Logic; Jul2017, Vol. 18 Issue 3, p1-42, 42p
Schlagwörter: RECURSION theory, INFINITY (Mathematics), MACHINE theory, GRAPH theory, RANKING (Statistics)
-
15
Autoren: et al.
Quelle: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p
-
16
Autoren:
-
17
-
18
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
-
19
Autoren: et al.
Resource Type: eBook.
Schlagworte: Machine theory, Computational complexity, Recursion theory
-
20
Autoren: George Tourlakis
Resource Type: eBook.
Schlagworte: Computable functions, Recursion theory, Computational complexity, Computer science, Technology—Philosophy
Categories: COMPUTERS / Computer Science, MATHEMATICS / Logic, SCIENCE / Philosophy & Social Aspects, TECHNOLOGY & ENGINEERING / General
Full Text Finder 
Nájsť tento článok vo Web of Science