Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

What Is Cognitive Psychology? identifies the theoretical foundations of cognitive psychology beginning with the basics of information processing. From these foundations, psychologists can identify the architecture of cognition to understand its role in debates about its true nature.

Cognitive Science, Information Processing, Turing Machine, Human Cognition, Primary Memory, Functional Analysis --- Cognitive science. --- Cognitive Science, Information Processing, Turing Machine, Human Cognition, Primary Memory, Functional Analysis.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*A1 --- 681.3*F0 --- 681.3*A1 Introductory and survey --- Introductory and survey --- Computerwetenschap--?*F0 --- Recursivity --- Turing Machine --- Recursive Functions --- Grammar

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.

Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.

Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"

Research & information: general --- Mathematics & science --- definability --- nonconstructible reals --- projective hierarchy --- generic models --- almost disjoint forcing --- Harvey Friedman’s problem --- almost-disjoint forcing --- universal algebraic geometry --- affine algebraic geometry --- elementary equivalence --- isotypic algebras --- first order rigidity --- Ind-group --- affine spaces --- automorphisms --- free associative algebras --- Weyl algebra automorphisms --- polynomial symplectomorphisms --- deformation quantization --- infinite prime number --- semi-inner automorphism --- embeddability of varieties --- undecidability --- noncommutative Gröbner-Shirshov basis --- finitely presented algebraic systems --- algorithmic unsolvability --- turing machine --- discrete optimization --- exact algorithm --- additively exact algorithm --- graph transformation --- graph of degree 2 --- chain-cycle graph --- operation cost --- minimization of total cost --- definability of definable --- tarski problem --- type theoretic hierarchy --- adaptive resource --- resilience --- resistance --- tipping point --- theory of catastrophes