Suchergebnisse - abstracts AND automatic computability AND recursion theory

A pathological punctually 1-decidable structure.

Autoren: Hammatt, Ellen Turetsky, Dan Melnikov, Alexander G. et al.

Quelle: Proceedings of the American Mathematical Society; Oct2025, Vol. 153 Issue 10, p4447-4462, 16p

Schlagwörter: MATHEMATICAL logic, DECIDABILITY (Mathematical logic), RECURSION theory

KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES: Knuth-Bendix for groups with infinitely many rules

Autoren: Paul J. Sanders David B. A. Epstein

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

Zugangs-URL: http://arxiv.org/pdf/math/0001035
http://arxiv.org/abs/math/0001035
https://zbmath.org/1845101
https://doi.org/10.1142/s0218196700000352
https://dblp.uni-trier.de/db/journals/ijac/ijac10.html#EpsteinS00
https://www.worldscientific.com/doi/10.1142/S0218196700000352

Recursion in programs, thought, and language.

Autoren: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert et al.

Quelle: Psychonomic Bulletin & Review; Apr2022, Vol. 29 Issue 2, p430-454, 25p

Schlagwörter: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

Alpha-Structural Recursion and Induction.

Autoren: Pitts, Andrew M.

Quelle: Journal of the ACM; May2006, Vol. 53 Issue 3, p459-506, 48p

Schlagwörter: PERMUTATIONS, RECURSION theory, MATHEMATICAL induction, FINITE element method, COMPUTER programming

Automatic reduction of cuch expression by means of the value method: Automatic reduction of CUCH expression by means of the value method

Autoren: G. Ausiello

Quelle: Calcolo. 5:174-184

Schlagwörter: General topics in the theory of software, Formal languages and automata, Computability and recursion theory, Theorem proving (deduction, resolution, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3473280
https://link.springer.com/article/10.1007/BF02576064

A Survey of Nature-Inspired Computing: Membrane Computing.

Autoren: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID et al.

Quelle: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p

Schlagwörter: COMPUTATIONAL complexity, NP-complete problems, RECURSION theory, CELL anatomy, COMPUTER systems, BIOLOGICALLY inspired computing

Computability Theory & Automata Theory

Autoren: Kristy Plante Tomas Jensen

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Machine theory

Categories: MATHEMATICS / Logic, MATHEMATICS / Infinity

A higher-order implementation of rewriting

Autoren: Lawrence C. Paulson

Quelle: Science of Computer Programming. 3:119-149

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

Extending properly n-REA sets¹.

Autoren: Cholak, Peter Gerdes, Peter

Quelle: Computability; 2022, Vol. 11 Issue 3/4, p241-267, 27p

Schlagwörter: COMPUTABLE functions, RECURSION theory

Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind.

Autoren: Bánréti, Zoltán Hoffmann, Ildikó Vincze, Veronika

Quelle: Frontiers in Psychology; 3/31/2016, p1-21, 21p

Schlagwörter: RECURSION theory, THEORY of mind, APHASIA, ALZHEIMER'S disease research, LEARNING disabilities research

Electrical analysis of logical complexity: an exploratory eeg study of logically valid/invalid deducive inference.

Autoren: Salto, Francisco Requena, Carmen Alvarez-Merino, Paula et al.

Quelle: Brain Informatics; 6/7/2023, Vol. 10 Issue 1, p1-15, 15p

Schlagwörter: ELECTROENCEPHALOGRAPHY, ALPHA rhythm, PROBABILITY theory

Collapsible Pushdown Automata and Recursion Schemes.

Autoren: HAGUE, MATTHEW MURAWSKI, ANDRZEJ S. ONG, C.-H. LUKE 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)

Multi-Tape and Infinite-State Automata--A Survey.

Autoren: Oettinger, A. G. Fischer, Patrick C.

Quelle: Communications of the ACM; Dec1965, Vol. 8 Issue 12, p799-805, 7p

Schlagwörter: TURING machines, SEQUENTIAL machine theory, COMPUTATIONAL linguistics, RECURSION theory, MACHINE theory, ALGORITHMS

From Fieldwork to Linguistic Theory

Autoren: Gibson, Edward Poliak, Moshe

Resource Type: eBook.

Categories: LANGUAGE ARTS & DISCIPLINES / Linguistics / General

Complexity, Logic, and Recursion Theory

Autoren: Andrea Sorbi

Resource Type: eBook.

Schlagworte: Recursion theory, Computational complexity

Categories: MATHEMATICS / General, MATHEMATICS / Applied

Algorithms for Constructing Computably Enumerable Sets

Autoren: Kenneth J. Supowit

Resource Type: eBook.

Schlagworte: Computer science, Computable functions, Recursion theory, Set theory, Computer science—Mathematics

Categories: COMPUTERS / Computer Science, MATHEMATICS / Applied, MATHEMATICS / Logic, MATHEMATICS / Set Theory

Universe, Computation, and Mind as Recursive Harmonic Resonance

Autoren: Kulik, Dean

Algebraic Computability and Enumeration Models : Recursion Theory and Descriptive Complexity

Autoren: Cyrus F. Nourani

Resource Type: eBook.

Schlagworte: Functor theory, Model theory, Computable functions, Algebra, Homological, Kleene algebra

Categories: MATHEMATICS / Algebra / General, MATHEMATICS / Geometry / General, MATHEMATICS / Set Theory

An Overview of Type Theories.

Autoren: Guallart, Nino

Quelle: Axiomathes: Global Philosophy; Mar2015, Vol. 25 Issue 1, p61-77, 17p

Schlagwörter: ONTIC (Computer system), AUTOMATIC theorem proving, EPISTEMIC logic, MODAL logic, MECHANISM (Philosophy)

The Geometry of Linear Higher-Order Recursion.

Autoren: Lago, Ugo Dal

Quelle: ACM Transactions on Computational Logic; Feb2009, Vol. 10 Issue 2, p8-8.38, 38p, 6 Diagrams, 6 Charts

Schlagwörter: RECURSION theory, MATHEMATICAL logic, LINEAR dependence (Mathematics), POLYNOMIALS, LAMBDA calculus