Search Results - world problems, etc. in computability and recursion theory*

ON DIOPHANTINE SINGLEFOLD SPECIFICATIONS.

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

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

Subject Terms: 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

Authors: Edwards, Darren J.

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

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

A Survey of Nature-Inspired Computing: Membrane Computing.

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

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

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

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

Authors: Qiu, Siyuan Xu, Jianfeng

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

Subject Terms: MODEL theory, INFORMATION theory, SEMANTICS, MATHEMATICAL logic

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

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

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

Structured Dynamics in the Algorithmic Agent.

Authors: Ruffini, Giulio Castaldo, Francesca Vohryzek, Jakub

Source: Entropy; Jan2025, Vol. 27 Issue 1, p90, 54p

Subject Terms: COMPUTATIONAL intelligence, NOETHER'S theorem, INFORMATION theory, GROUP theory, KOLMOGOROV complexity, MIRROR neurons

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

Authors: Michael Shapiro

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

Subject Terms: 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

File Description: application/xml

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

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

Authors: Claude Marché

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

Subject Terms: 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

File Description: application/xml

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

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

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

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

ALGORITHMIC PROBLEMS IN VARIETIES: Algorithmic problems in varieties

Authors: Mark Sapir Olga Kharlampovich

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

Subject Terms: 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

File Description: application/xml

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

Authors: Louxin Zhang

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

Subject Terms: 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

File Description: application/xml

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

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

Authors: Neri, Morenikeji Powell, Thomas

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

Subject Terms: STOCHASTIC convergence, STOCHASTIC processes, PROOF theory, PROBABILITY theory, DATA extraction

Gödelian embodied self-referential genomic intelligence: lessons for AI and AGI from the genomic blockchain.

Authors: Markose, Sheri

Source: Frontiers in Robotics & AI; 2025, p1-8, 8p

Subject Terms: ARTIFICIAL intelligence, INFORMATION technology security, AUTONOMY (Philosophy), BLOCKCHAINS, PARADOX, AUTOPOIESIS

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

Authors: Xie, Jingnan Hunt III, Harry B. Stearns, Richard E.

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

Subject Terms: HILBERT'S tenth problem, REAL variables, PHILOSOPHY of language, COMPUTATIONAL complexity, FORMAL languages, COMPUTABLE analysis

LOGICAL AND PHILOSOPHICAL ANALYSIS OF PARADOXES ACCORDING TO THEIR TYPES.

Alternate Title: ANÁLISE LÓGICA E FILOSÓFICA DOS PARADOXOS DE ACORDO COM SEUS TIPOS. (Portuguese)

Authors: Yildirim, Dilek Başerer

Source: Synesis; Jul-Sep2025, Vol. 17 Issue 3, p141-175, 35p

Subject Terms: PARADOX, LOGIC, CRITICAL thinking, COGNITIVE analysis, REFLECTION (Philosophy)

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

Authors: Oksas, André

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

Subject Terms: DISCRETE mathematics, MATHEMATICAL errors, SYSTEMS theory, PHILOSOPHY of mathematics, INFORMATION technology

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

Authors: Quinon, Paula

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

Subject Terms: RECURSION theory, MATHEMATICAL logic, MATHEMATICAL forms

People: CARNAP, Rudolf, 1891-1970

On the first-order parts of problems in the Weihrauch degrees.

Authors: Dzhafarov, Damir D. Solomon, Reed Yokoyama, Keita

Source: Computability; 2024, Vol. 13 Issue 3/4, p363-375, 13p

Subject Terms: LITERATURE

Recursion in programs, thought, and language.

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

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

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

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.

Authors: Blanc, Manon Bournez, Olivier

Source: International Journal of Foundations of Computer Science; Nov2025, Vol. 36 Issue 7, p989-1016, 28p

Subject Terms: COMPUTABLE functions, COMPUTABLE analysis, ORDINARY differential equations, LINEAR differential equations, POLYNOMIAL time algorithms, MATHEMATICAL functions, COMPUTATIONAL complexity