Výsledky vyhľadávania - work problems, etc. in computability and recursion theory

On Strong and Weak Logics for Paraconsistent Computability.

Autori: Weber, Zach Cano-Jorge, Fernando

Zdroj: Journal of Applied Logics- IfCoLog Journal of Logics & their Applications (FLAP); Jun2025, Vol. 12 Issue 5, p1349-1381, 33p

Predmety: RECURSION theory, ARITHMETIC, LOGIC, MATHEMATICS, VIRTUES

Language Learnability in the Limit: A Generalization of Gold’s Theorem: Language learnability in the limit: a generalization of Gold's theorem

Autori: Fernando C. Alves

Zdroj: Journal of Logic, Language and Information. 32:363-372

Predmety: recursion theory, inductive inference, Computational learning theory, learning in the limit, Formal languages and automata, 06 humanities and the arts, 0101 mathematics, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Gold's theorem

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/7726393
https://doi.org/10.1007/s10849-022-09391-w

A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Autori: Dejan Delić

Zdroj: Transactions of the American Mathematical Society. 352:3065-3101

Predmety: undecidable equational theory, Decidability of theories and sets of sentences, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Equational classes, universal algebra in model theory, many-sorted logics, 0102 computer and information sciences, 0101 mathematics, Automata and formal grammars in connection with logical questions, Word problems, etc. in computability and recursion theory, recursively solvable word problems, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://zbmath.org/1449843
https://doi.org/10.1090/s0002-9947-99-02339-9
https://www.ams.org/journals/tran/2000-352-07/S0002-9947-99-02339-9/home.html
https://www.ams.org/tran/2000-352-07/S0002-9947-99-02339-9/S0002-9947-99-02339-9.pdf
https://www.jstor.org/stable/118198

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

Coding in the existential theory of concatenation

Autori: Büchi, J. R. Senger, St.

Zdroj: The Collected Works of J. Richard Büchi ISBN: 9781461389309

Predmety: Prefix, length-variable, comma-free codes, 510.mathematics, Free semigroups, generators and relations, word problems, 4. Education, 0102 computer and information sciences, 0101 mathematics, Word problems, etc. in computability and recursion theory, existential theory, 01 natural sciences, Article, existentially definable relation over concatenation, diophantine

Popis súboru: application/xml; image/jpeg; application/pdf

Prístupová URL adresa: https://zbmath.org/4053596
https://doi.org/10.1007/bf02017493
https://link.springer.com/content/pdf/10.1007/BF02017493.pdf
https://eudml.org/doc/138054
https://rd.springer.com/chapter/10.1007/978-1-4613-8928-6_36
https://dblp.uni-trier.de/db/journals/aml/aml26.html#BuchiS87
https://link.springer.com/article/10.1007/BF02017493

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)

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

On the work of P. S. Novikov and his graduate students in algorithmic questions of algebra

Autori: Adyan, S. I.

Predmety: History of mathematical logic and foundations, Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations, Applications of computability and recursion theory, History of group theory, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Word problems, etc. in computability and recursion theory, Research exposition (monographs, survey articles) pertaining to group theory

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3545646

The word problem for division rings

Autori: Angus Macintyre

Zdroj: Journal of Symbolic Logic. 38:428-436

Predmety: Division rings and semisimple Artin rings, 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/jsyml/jsyml38.html#MacIntyre73a
https://doi.org/10.2307/2273039
https://www.jstor.org/stable/2273039
https://projecteuclid.org/euclid.jsl/1183738755

The word problem for free fields

Autori: Paul M. Cohn

Zdroj: Journal of Symbolic Logic. 38:309-314

Predmety: Division rings and semisimple Artin rings, Connections between field theory and logic, 0101 mathematics, 16. Peace & justice, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://www.jstor.org/stable/2272067
https://dblp.uni-trier.de/db/journals/jsyml/jsyml38.html#Cohn73
https://www.maths.ed.ac.uk/~aar/papers/cohnword.pdf
https://projecteuclid.org/euclid.jsl/1183738636

A note on a special one-rule semi-Thue system

Autori: Matthias Jantzen

Zdroj: Information Processing Letters. 21:135-140

Predmety: complete rewriting system, Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science, Church-Rosser property, Thue system, 0102 computer and information sciences, Thue and Post systems, etc, 0101 mathematics, Symbolic computation and algebraic computation, Word problems, etc. in computability and recursion theory, 01 natural sciences, quotient monoid

Popis súboru: application/xml

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0020019085900183
https://doi.org/10.1016/0020-0190(85)90018-3
https://dblp.uni-trier.de/db/journals/ipl/ipl21.html#Jantzen85

Automatentheorie und formale Sprachen

Autori: Hotz, G.

Predmety: computations of relations, Specification and verification (program logics, model checking, etc.), categorical theory of automata, autonomous automata, Research exposition (monographs, survey articles) pertaining to computer science, Analysis of algorithms and problem complexity, syntactic correctness of programs, Categories of machines, automata, complexity of parsing, Formal languages and automata, Theory of compilers and interpreters, work problems, formal series, Semigroups in automata theory, linguistics, etc, survey, Word problems, etc. in computability and recursion theory, time and space complexity measures of computations

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3639151

Positive eigenvalues and two-letter generalized words

Autori: Ilya M. Spitkovsky Charles R. Johnson Christopher J. Hillar

Zdroj: The Electronic Journal of Linear Algebra. 9

Predmety: projections, Eigenvalues, singular values, and eigenvectors, Combinatorics on words, letter, Mathematics - Operator Algebras, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), Mathematics - Rings and Algebras, 01 natural sciences, generalized word, Free lattices, projective lattices, word problems, positive eigenvalues, Word problems (aspects of algebraic structures), Rings and Algebras (math.RA), 15A18, 15A57, positive definite matrices, FOS: Mathematics, Hermitian, skew-Hermitian, and related matrices, 0101 mathematics, Operator Algebras (math.OA), Word problems, etc. in computability and recursion theory

Popis súboru: application/xml

Prístupová URL adresa: https://journals.uwyo.edu/index.php/ela/article/download/139/139
http://arxiv.org/abs/math/0504573
https://zbmath.org/1716192
https://doi.org/10.13001/1081-3810.1069
https://eudml.org/doc/122134
https://journals.uwyo.edu/index.php/ela/article/view/139
http://repository.uwyo.edu/ela/vol9/iss1/2/
http://ui.adsabs.harvard.edu/abs/2005math......4573H/abstract
http://siba-sinmemis.unile.it/journals/ELA/ela-articles/articles/vol9_pp21-26.pdf
https://core.ac.uk/display/148751213

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

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

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

Some recent results on squarefree words

Autori: Berstel, Jean

Prispievatelia: Berstel, Jean

Zdroj: Lecture Notes in Computer Science ISBN: 9783540129202

Predmety: Free semigroups, generators and relations, word problems, square-free words, repetitions in words, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), 0102 computer and information sciences, Thue and Post systems, etc, 0101 mathematics, Thue systems, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: http://www.numdam.org/item/PDML_1985___2B_21_0.pdf
https://zbmath.org/3977002
https://rd.springer.com/chapter/10.1007/3-540-12920-0_2
https://dblp.uni-trier.de/db/conf/stacs/stacs84.html#Berstel84
https://link.springer.com/chapter/10.1007%2F3-540-12920-0_2
https://link.springer.com/content/pdf/10.1007%2F3-540-12920-0_2.pdf
https://hal.science/hal-00619879v1

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