Výsledky vyhledávání - work problems, etc. in computability and recursion theory*

On Strong and Weak Logics for Paraconsistent Computability.

Autoři: 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

Témata: 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

Autoři: Fernando C. Alves

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

Témata: 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 souboru: application/xml

Pří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

Autoři: Dejan Delić

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

Témata: 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 souboru: application/xml

Pří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

Chair of Mathematical Logic and Theory of Algorithms.

Autoři: Semenov, A. L. Babenko, M. A. Belov, A. Ya. a další

Zdroj: Moscow University Mathematics Bulletin; Feb2025, Vol. 80 Issue 1, p23-33, 11p

ON DIOPHANTINE SINGLEFOLD SPECIFICATIONS.

Autoři: CANTONE, D. CUZZIOL, L. OMODEO, E. G.

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

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

Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions.

Autoři: Yamakami, Tomoyuki

Zdroj: Mathematical Structures in Computer Science; Nov2024, Vol. 34 Issue 10, p710-745, 36p

Témata: TURING machines, QUANTUM computing, LOGIC, DEFINITIONS

THE DISCONTINUITY PROBLEM.

Autoři: BRATTKA, VASCO

Zdroj: Journal of Symbolic Logic; Sep2023, Vol. 88 Issue 3, p1191-1212, 22p

Témata: SET theory, AXIOMATIC design, COMPUTABLE functions, AXIOMS

2024 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC, LOGIC COLLOQUIUM 2024 University of Gothenburg Gothenburg, Sweden 24 June – 28 June, 2024.

Zdroj: Bulletin of Symbolic Logic; Dec2024, Vol. 30 Issue 4, p580-614, 35p

Témata: MATHEMATICAL proofs, COMPUTER logic, PHILOSOPHY of science, MATHEMATICAL logic, DISCRETE mathematics, WORD problems (Mathematics), RAMSEY numbers, PROOF theory, KOLMOGOROV complexity

Probabilities on Cones of Multimatrix Variate Distributions and Elliptical Affine Shape Distributions Under Real Normed Division Algebras.

Autoři: Caro-Lopera, Francisco J. Díaz-García, José A.

Zdroj: Sankhya A; Aug2025, Vol. 87 Issue 2, p349-377, 29p

On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales.

Autoři: Neri, Morenikeji Powell, Thomas

Zdroj: Transactions of the American Mathematical Society, Series B; 7/24/2025, Vol. 12, p974-1019, 46p

Témata: STOCHASTIC convergence, STOCHASTIC processes, PROOF theory, PROBABILITY theory, DATA extraction

Coding in the existential theory of concatenation

Autoři: Büchi, J. R. Senger, St.

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

Témata: 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 souboru: application/xml; image/jpeg; application/pdf

Pří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

A Survey of Nature-Inspired Computing: Membrane Computing.

Autoři: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a další

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

Témata: 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

Autoři: Adyan, S. I.

Témata: 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 souboru: application/xml

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

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

Autoři: Edwards, Darren J.

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

Témata: LANGUAGE models, ARTIFICIAL intelligence, COGNITIVE bias, QUANTUM operators, COGNITIVE maps (Psychology)

Research on a General State Formalization Method from the Perspective of Logic.

Autoři: Qiu, Siyuan Xu, Jianfeng

Zdroj: Mathematics (2227-7390); Oct2025, Vol. 13 Issue 20, p3324, 36p

Témata: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

On Productiveness and Complexity in Computable Analysis Through Rice-Style Theorems for Real Functions.

Autoři: Xie, Jingnan Hunt III, Harry B. Stearns, Richard E.

Zdroj: Mathematics (2227-7390); Oct2024, Vol. 12 Issue 20, p3248, 12p

Témata: HILBERT'S tenth problem, REAL variables, PHILOSOPHY of language, COMPUTATIONAL complexity, FORMAL languages, COMPUTABLE analysis

Set Theory.

Autoři: Farah, Ilijas Schindler, Ralf Sinapova, Dima a další

Zdroj: Oberwolfach Reports; 2025, Vol. 22 Issue 1, p75-135, 60p

Témata: SET theory, RESEARCH personnel, COMBINATORICS, MATHEMATICS

Where George Spencer-Brown went wrong – re-entry recalculated.

Autoři: Oksas, André

Zdroj: Kybernetes; 2025, Vol. 54 Issue 8, p4300-4327, 28p

Témata: DISCRETE mathematics, MATHEMATICAL errors, SYSTEMS theory, PHILOSOPHY of mathematics, INFORMATION technology

Construction of Countably Infinite Programs That Evade Malware/Non-Malware Classification for Any Given Formal System †.

Autoři: Liagkou, Vasiliki Nastou, Panagiotis E. Spirakis, Paul a další

Zdroj: Cryptography (2410-387X); Mar2025, Vol. 9 Issue 1, p16, 26p

Témata: MALWARE, ANTI-malware (Computer software), TURING machines, INTERNET security, CLASSIFICATION algorithms

The word problem for division rings

Autoři: Angus Macintyre

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

Témata: Division rings and semisimple Artin rings, 0101 mathematics, Word problems, etc. in computability and recursion theory, 01 natural sciences

Popis souboru: application/xml

Pří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