Výsledky vyhľadávania - world problems, etc. in computability AND recursion theory~

ON DIOPHANTINE SINGLEFOLD SPECIFICATIONS.

Autori: CANTONE, D. CUZZIOL, L. OMODEO, E. G.

Zdroj: Le Matematiche; 2024, Vol. 79 Issue 2, p585-620, 36p

Predmety: HILBERT'S tenth problem, CHINESE remainder theorem, MATHEMATICAL logic, RECURSION theory, RECURSIVE functions, DIOPHANTINE equations, QUADRATIC forms, BINOMIAL coefficients

Further N -Frame networking dynamics of conscious observer-self agents via a functional contextual interface: predictive coding, double-slit quantum mechanical experiment, and decision-making fallacy modeling as applied to the measurement problem in humans and AI

Autori: Edwards, Darren J.

Zdroj: Frontiers in Computational Neuroscience; 2025, p1-53, 53p

Predmety: LANGUAGE models, ARTIFICIAL intelligence, COGNITIVE bias, QUANTUM operators, COGNITIVE maps (Psychology)

THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE: The word problem of ACD-ground theories is undecidable

Autori: Claude Marché

Zdroj: International Journal of Foundations of Computer Science. :81-92

Predmety: Decidability of theories and sets of sentences, Word problems (aspects of algebraic structures), Grammars and rewriting systems, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences, equational theory, ground equations

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/94721
https://doi.org/10.1142/s0129054192000085
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs3.html#Marche92
https://www.worldscientific.com/doi/abs/10.1142/S0129054192000085

A Survey of Nature-Inspired Computing: Membrane Computing.

Autori: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a ďalší

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

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

A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS: A note on context-sensitive languages and word problems

Autori: Michael Shapiro

Zdroj: International Journal of Algebra and Computation. :493-497

Predmety: Free semigroups, generators and relations, word problems, short asynchronous combings, deterministic linear bounded automata, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, Group Theory (math.GR), 0102 computer and information sciences, finitely generated subgroups, 01 natural sciences, context- sensitive word problem, Semigroups in automata theory, linguistics, etc, FOS: Mathematics, context-sensitive languages, 0101 mathematics, Geometric group theory, Word problems, etc. in computability and recursion theory, automatic groups, Mathematics - Group Theory

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/math/9306204
https://researchportal.bath.ac.uk/en/publications/a-note-on-context-sensitive-languages-and-word-problems
https://www.worldscientific.com/doi/abs/10.1142/S0218196794000129
https://dblp.uni-trier.de/db/journals/ijac/ijac4.html#Shapiro94
https://doi.org/10.1142/S0218196794000129

ALGORITHMIC PROBLEMS IN VARIETIES: Algorithmic problems in varieties

Autori: Mark Sapir Olga Kharlampovich

Zdroj: International Journal of Algebra and Computation. :379-602

Predmety: equational problem, Free semigroups, generators and relations, word problems, isomorphism problem, groups, open problems, 0102 computer and information sciences, Symbolic computation and algebraic computation, identity problem, 01 natural sciences, semigroups, Quasivarieties and varieties of groups, relatively free algebra, Higman property, Lie algebras, varieties of algebras, survey, 0101 mathematics, Word problems, etc. in computability and recursion theory, word problem, \(T\)-ideals, identities, varieties of associative rings and algebras, Identities, free Lie (super)algebras, Minsky machines, simulating differential equations, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Varieties and pseudovarieties of semigroups, algorithmic problems, Word problems (aspects of algebraic structures), associative algebras

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijac/ijac5.html#KharlampovichS95
https://www.worldscientific.com/doi/abs/10.1142/S0218196795000227

ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER: On the conjugacy problem for one-relator monoids with elements of finite order

Autori: Louxin Zhang

Zdroj: International Journal of Algebra and Computation. :209-220

Predmety: conjugacy problem, Free semigroups, generators and relations, word problems, special monoids, decidability, one-relator monoid, 0102 computer and information sciences, Thue and Post systems, etc, 0101 mathematics, primitive word, Word problems, etc. in computability and recursion theory, 01 natural sciences, presentation

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijac/ijac2.html#Zhang92
https://www.worldscientific.com/doi/abs/10.1142/S021819679200013X

Can Church's thesis be viewed as a Carnapian explication?

Autori: Quinon, Paula

Zdroj: Synthese; Mar2021 Supplement 5, Vol. 198, p1047-1074, 28p

Predmety: RECURSION theory, MATHEMATICAL logic, MATHEMATICAL forms

Osoby: CARNAP, Rudolf, 1891-1970

Recursion in programs, thought, and language.

Autori: Johnson-Laird, P. N. Bucciarelli, Monica Mackiewicz, Robert a ďalší

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

Predmety: RECURSIVE functions, RECURSION theory, KOLMOGOROV complexity, NATURAL languages, SHORT-term memory

ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES: On groups which are syntactic monoids of deterministic context-free languages.

Autori: Claas E. Röver

Zdroj: International Journal of Algebra and Computation. 14:499-504

Predmety: Extensions, wreath products, and other compositions of groups, context-free languages, syntactic monoids, Semigroups in automata theory, linguistics, etc, wreath products, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Formal languages and automata, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/2113239
https://doi.org/10.1142/s0218196704001876
https://dblp.uni-trier.de/db/journals/ijac/ijac14.html#Rover04
https://doi.org/10.1142/S0218196704001876

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

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

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

Prístupová URL adresa: 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 theoretic foundation of computation over real numbers.

Autori: Ng, Keng Meng Tavana, Nazanin R Yang, Yue

Zdroj: Journal of Logic & Computation; Oct2021, Vol. 31 Issue 7, p1660-1689, 30p

Predmety: REAL numbers, COMPUTABLE functions, RECURSIVE functions, RECURSION theory

Geografický termín: NOVA Scotia

TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS: Transfinite equations in transfinite strings

Autori: Sándor Horváth Christian Choffrut

Zdroj: International Journal of Algebra and Computation. 10:625-649

Predmety: Combinatorics on words, Semigroups in automata theory, linguistics, etc, transfinite strings, Formal languages and automata, 0102 computer and information sciences, 06 humanities and the arts, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, transfinite equations

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1845104
https://doi.org/10.1142/s021819670000025x
https://dblp.uni-trier.de/db/journals/ijac/ijac10.html#ChoffrutH00

Automatic Groups Associated with Word Orders Other than Shortlex: Automatic groups associated with word orders other than shortlex

Autori: Sarah Rees

Zdroj: International Journal of Algebra and Computation. :575-598

Predmety: Generators, relations, and presentations of groups, Baumslag-Solitar groups, word orders, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Group Theory (math.GR), Symbolic computation and algebraic computation, algorithms, 01 natural sciences, wreath product orders, 0103 physical sciences, FOS: Mathematics, Software, source code, etc. for problems pertaining to group theory, 0101 mathematics, Word problems, etc. in computability and recursion theory, automatic groups, Mathematics - Group Theory

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/pdf/math/9705208v1.pdf
http://arxiv.org/abs/math/9705208
https://www.worldscientific.com/doi/abs/10.1142/S0218196798000272
https://dblp.uni-trier.de/db/journals/ijac/ijac8.html#Rees98
https://ui.adsabs.harvard.edu/abs/1997math......5208R/abstract

A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive: A variety where the set of subalgebras of finite simple algebras is not recursive

Autori: Mark Sapir Stanislav I. Kublanovsky

Zdroj: International Journal of Algebra and Computation. :681-688

Predmety: finite simple algebras, binary operations, Word problems (aspects of algebraic structures), unsolvability of algorithmic problems, 0102 computer and information sciences, finitely based variety of algebras, subalgebras, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/ijac/ijac8.html#KublanovskyS98a

IDENTITIES IN THE VARIETY OF CENTER-BY-${\mathfrak R}_2 {\mathfrak U}$ LIE ALGEBRAS: Identities in the variety of center-by-\(\mathfrak N_{2} \mathfrak U\) Lie algebras

Autori: Olga Kharlampovich Dion Gildenhuys

Zdroj: International Journal of Algebra and Computation. :493-521

Predmety: Solvable, nilpotent (super)algebras, word problem, variety of center by 2-nilpotent- by-abelian Lie algebras, Identities, free Lie (super)algebras, Word problems (aspects of algebraic structures), Rings with polynomial identity, polynomial identity, local finiteness, characteristic zero, Word problems, etc. in computability and recursion theory, identities

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/118361
https://doi.org/10.1142/s021819679100033x
https://www.worldscientific.com/doi/pdf/10.1142/S021819679100033X

Turing degrees in Polish spaces and decomposability of Borel functions.

Autori: Gregoriades, Vassilios Kihara, Takayuki Ng, Keng Meng

Zdroj: Journal of Mathematical Logic; Apr2021, Vol. 21 Issue 1, pN.PAG-N.PAG, 41p

Predmety: BOREL sets, RECURSION theory, ANALYTIC functions, SET theory, SPACE, LOGICAL prediction

An inside/outside Ramsey theorem and recursion theory.

Autori: Fiori-Carones, Marta Shafer, Paul Soldà, Giovanni

Zdroj: Transactions of the American Mathematical Society; Mar2022, Vol. 375 Issue 3, p1977-2024, 48p

Predmety: RECURSION theory, REVERSE mathematics, RAMSEY numbers, COMPUTABLE functions, RAMSEY theory, SAND

Die Theorie algorithmischer Sozialität (TaS). (German)

Alternate Title: A theory of algorithmic sociality (TaS). (English)

Autori: Seyfert, Robert

Zdroj: Österreichische Zeitschrift für Soziologie; Mar2024, Vol. 49 Issue 1, p23-46, 24p

Reclaiming AI as a Theoretical Tool for Cognitive Science.

Autori: van Rooij, Iris Guest, Olivia Adolfi, Federico a ďalší

Zdroj: Computational Brain & Behavior; Dec2024, Vol. 7 Issue 4, p616-636, 21p