The Molecular Basis of Neural Memory. Part 7:  Neural Intelligence (NI) versus Artificial Intelligence (AI)

Gerard Marx; Chaim Gilon; Gerard Marx; Chaim Gilon

doi:10.3934/medsci.2017.3.241

AIMS Medical Science

2017, Volume 4, Issue 3: 241-260. doi: 10.3934/medsci.2017.3.241

Previous Article Next Article

Review

The Molecular Basis of Neural Memory. Part 7: Neural Intelligence (NI) versus Artificial Intelligence (AI)

Gerard Marx ^{1
,
,},
Chaim Gilon ²

1.
MX Biotech Ltd., Jerusalem, Israel
2.
Institute of Chemistry, Hebrew University, Jerusalem, Israel

Received: 30 April 2017 Accepted: 03 July 2017 Published: 15 July 2017

The link of memory to intelligence is incontestable, though the development of electronic artifacts with memory has confounded cognitive and computer scientists’ conception of memory and its relevance to “intelligence”. We propose two categories of “Intelligence”: (1) Logical (objective) — mathematics, numbers, pattern recognition, games, programmable in binary format. (2) Emotive (subjective) — sensations, feelings, perceptions, goals desires, sociability, sex, food, love. The 1^st has been reduced to computational algorithms of which we are well versed, witness global technology and the internet. The 2^nd relates to the mysterious process whereby (psychic) emotive states are achieved by neural beings sensing, comprehending, remembering and dealing with their surroundings.
Many theories and philosophies have been forwarded to rationalize this process, but as neuroscientists, we remain dissatisfied. Our own musings on universal neural memory, suggest a tripartite mechanism involving neurons interacting with their surroundings, notably the neural extracellular matrix (nECM) with dopants [trace metals and neurotransmitters (NTs)]. In particular, the NTs are the molecular encoders of emotive states. We have developed a chemographic representation of such a molecular code.
To quote Longuet-Higgins, “Perhaps it is time for the term ‘artificial intelligence’ to be replaced by something more modest and less provisional”. We suggest “artifact intelligence” (ARTI) or “machine intelligence” (MI), neither of which imply emulation of emotive neural processes, but simply refer to the ‘demotive’ (lacking emotive quality) capability of electronic artifacts that employ a recall function, to calculate algorithms.

Keywords:

cognitive information; emotions; mentation; memory; metal complex; neurotransmitter

Citation: Gerard Marx, Chaim Gilon. The Molecular Basis of Neural Memory. Part 7: Neural Intelligence (NI) versus Artificial Intelligence (AI)[J]. AIMS Medical Science, 2017, 4(3): 241-260. doi: 10.3934/medsci.2017.3.241

Related Papers:

[1]	Qiuxia Hu, Bilal Khan, Serkan Araci, Mehmet Acikgoz . New double-sum expansions for certain Mock theta functions. AIMS Mathematics, 2022, 7(9): 17225-17235. doi: 10.3934/math.2022948
[2]	Suxia Wang, Tiehong Zhao . New refinements of Becker-Stark inequality. AIMS Mathematics, 2024, 9(7): 19677-19691. doi: 10.3934/math.2024960
[3]	Zhenhua Su, Zikai Tang, Hanyuan Deng . Higher-order Randić index and isomorphism of double starlike trees. AIMS Mathematics, 2023, 8(12): 31186-31197. doi: 10.3934/math.20231596
[4]	Waleed Mohamed Abd-Elhameed, Youssri Hassan Youssri . Spectral tau solution of the linearized time-fractional KdV-Type equations. AIMS Mathematics, 2022, 7(8): 15138-15158. doi: 10.3934/math.2022830
[5]	Tie-Hong Zhao, Zai-Yin He, Yu-Ming Chu . On some refinements for inequalities involving zero-balanced hypergeometric function. AIMS Mathematics, 2020, 5(6): 6479-6495. doi: 10.3934/math.2020418
[6]	Mustafa Inc, Mamun Miah, Akher Chowdhury, Shahadat Ali, Hadi Rezazadeh, Mehmet Ali Akinlar, Yu-Ming Chu . New exact solutions for the Kaup-Kupershmidt equation. AIMS Mathematics, 2020, 5(6): 6726-6738. doi: 10.3934/math.2020432
[7]	Aslıhan ILIKKAN CEYLAN, Canan HAZAR GÜLEÇ . A new double series space derived by factorable matrix and four-dimensional matrix transformations. AIMS Mathematics, 2024, 9(11): 30922-30938. doi: 10.3934/math.20241492
[8]	Waleed Mohamed Abd-Elhameed, Abdullah F. Abu Sunayh, Mohammed H. Alharbi, Ahmed Gamal Atta . Spectral tau technique via Lucas polynomials for the time-fractional diffusion equation. AIMS Mathematics, 2024, 9(12): 34567-34587. doi: 10.3934/math.20241646
[9]	Ling Zhu . New inequalities of Wilker's type for hyperbolic functions. AIMS Mathematics, 2020, 5(1): 376-384. doi: 10.3934/math.2020025
[10]	Bai-Ni Guo, Dongkyu Lim, Feng Qi . Series expansions of powers of arcsine, closed forms for special values of Bell polynomials, and series representations of generalized logsine functions. AIMS Mathematics, 2021, 6(7): 7494-7517. doi: 10.3934/math.2021438

Abstract

1. Introduction

In ^[18] Ramanujan showed a total of 17 series for $1/\pi$ but he did not indicate how he arrived at these series. The Borwein brothers ^[5] gave rigorous proofs of Ramanujan's series for the first time and also obtained many new series for $1/\pi.$ Till now, many new Ramanujan's-type series for $1/\pi$ have been published, (see, for example, ^[4,6,8]). Chu ^[7], Liu ^[15,16] and Wei et al. ^[21,22] gave many $\pi$ -formula with free parameters by means of gamma functions and hypergeometric series. Guillera ^[10] proved a kind of bilateral semi-terminating series related to Ramanujan-like series for negative powers of $\pi$ . Moreover, Guillera and Zudilin ^[11] outlined an elementary method for proving numerical hypergeometric identities, in particular, Ramanujan-type identities for $1/\pi$ . Recently, $q$ -analogues of Ramanujan-type series for $1/\pi$ have caught the interests of many authors (see, for example, ^{[9,12,13,14,20,21]}).

Although various definitions for gamma functions are used in the literature, we adopt the following definition [23, p.76]

$\frac 1{\Gamma(z)} = ze^{\gamma z}\prod\limits_{n = 1}^\infty\left(1+\frac zn\right)e^{-\frac zn}$

where $\gamma$ is the Euler constant defined as

$\gamma = \lim\limits_{n\rightarrow \infty}\left(1+ \frac 12+\cdots+ \frac 1n-\log n\right).$

It is easy to verify that $\Gamma(1) = 1, \Gamma({ \frac 12}) = \sqrt\pi$ and $\Gamma({z+1}) = z\Gamma(z).$ It follows that for every positive integer $n$ , $\Gamma(n) = (n-1)!.$

For any complex $\alpha$ , we define the general rising shifted factorial by

$\begin{align} (z)_{{\alpha}} = \Gamma({z+{\alpha}})/\Gamma(z). \end{align}$

(1.1)

Obviously, $(z)_0 = 1.$ For every positive integer $n$ , we have

$(z)_n = \Gamma({z+n})/\Gamma(z) = z(z+1)\cdots(z+n-1)$

and

$(z)_{-n} = \Gamma({z-n})/\Gamma(z) = \frac 1{(z-1)(z-2)\ldots(z-n)}.$

For convenience, we use the following compact notations

$(a_1,a_2,\ldots,a_m)_n = (a_1)_n(a_2)_n\ldots(a_m)_n$

and

$(a)_{(n_1,n_2,\ldots,n_m)} = (a)_{n_1}(a)_{n_2}\ldots(a)_{n_m}.$

Following ^[1,3], the hypergeometric series is defined by

$_{{r+1}}F_{s}\left[\begin{array}{cccc}a_0,&a_1,&\ldots,&a_r\\&b_1,&\ldots,&b_s\end{array};z\right] = \sum\limits_{k = 0}^\infty \frac {(a_0, a_1,\ldots,a_r)_k}{(b_1,\ldots,b_s)_k} \frac {z^k}{k!},$

where $a_i, b_j(i = 0, 1, \ldots, r, j = 1, 2, \ldots, s)$ are complex numbers such that no zero factors appear in the denominators of the summand on the right hand side.

We let $F_{q:s; v}^{p:r; u}\ ({p, q, r, s, u, v\in \Bbb N_0 = \{0, 1, 2, \ldots\}})$ denote a general (Kampé de Fériet's) double hypergeometric function defined by (see ^[2,19])

$\begin{eqnarray*} &&F_{q:s;v}^{p:r;u}\left[\begin{array}{ccc}{\alpha}_1,\ldots,{\alpha}_p:&a_1,\ldots,a_r;&c_1,\ldots,c_u;\\ \beta_1,\ldots,\beta_q:&b_1,\ldots,b_s;&d_1,\ldots,d_v;\end{array}x,y\right]\\&& = \sum\limits_{m,n = 0}^\infty \frac {({\alpha}_1,\ldots,{\alpha}_p)_{m+n} (a_1,\ldots,a_r)_m(c_1,\ldots,c_u)_n}{(\beta_1,\ldots,\beta_q)_{m+n} (b_1,\ldots,b_s)_m(d_1,\ldots,d_v)_n} \frac {x^m}{m!} \frac {y^n}{n!}, \end{eqnarray*}$

where, for convergence of the double hypergeometric series,

$p+r\leq q+s+1{\quad}\text{and}{\quad} p+u\leq q+v+1,$

with equality only when $|x|$ and $|y|$ are appropriately constrained (see, for details, [19,Eq 1.3(29),p.27]).

There exist numerous identities for such series. For example, we have

Theorem 1.1 (See [,(30)] ) If $Re(e-d) > 0$ and $Re(d+e-a-b-c) > 0,$ then

$F_{1:1;1}^{0:3;3}\left[\begin{array}{ccc}-:&a,b,c;&d-a,d-b,d-c;\\d:&e;&d+e-a-b-c;\end{array}1,1\right] = \frac {\Gamma({e})\Gamma({e+d-a-b-c})\Gamma({e-d})}{\Gamma({e-a})\Gamma({e-b})\Gamma({e-c})}.$

In ^[15], Liu used the general rising shifted factorial and the Gauss summation formula to prove the following four-parameter series expansions formula, which implies infinitely many Ramanujan type series for $1/\pi$ and $\pi$ .

Theorem 1.2 For any complex ${\alpha}$ and $Re(c-a-b) > 0,$ we have

$\sum\limits_{n = 0}^\infty \frac {({\alpha})_{a+n}(1-{\alpha})_{b+n}}{n!\Gamma({c+n+1})} = \frac {({\alpha})_a(1-{\alpha})_b\Gamma({c-a-b})} {({\alpha})_{c-b}(1-{\alpha})_{c-a}}\cdot \frac {\sin \pi{\alpha}}\pi.$

Motivated by Liu's work, in this paper we derive the following result from Theorem 1.1 which enables us to give many double series expansions for $1/\pi$ and $\ \pi$ . To the best of our knowledge, most of the results in this paper have not previously appeared.

Theorem 1.3 If $d\in \Bbb N_0, Re(e-d+{\sigma}-{\delta}) > 0$ and $Re(d+e-a-b-c+{\delta}+{\sigma}-{\alpha}-\beta-{\gamma}) > 0,$ then

$\begin{align*} &\sum\limits_{m,n = 0}^\infty \frac {({\alpha})_{a+m}(\beta)_{b+m}({\gamma})_{c+m}({\delta}-{\alpha})_{d-a+n}({\delta}-\beta)_{d-b+n}({\delta}-{\gamma})_{d-c+n}} {m!n!({\delta}+d)_{m+n}({\sigma})_{e+m}({\delta}+{\sigma}-{\alpha}-\beta-{\gamma})_{d+e-a-b-c+n}}\\ & = \frac {({\alpha})_a(\beta)_b({\gamma})_c({\delta}-{\alpha})_{d-a}({\delta}-\beta)_{d-b}({\delta}-{\gamma})_{d-c}({\sigma}-{\delta})_{e-d}} {({\sigma}-{\alpha})_{e-a}({\sigma}-\beta)_{e-b}({\sigma}-{\gamma})_{e-c}} \cdot \frac {\Gamma({\sigma})\Gamma({{\sigma}-{\delta}})\Gamma({{\delta}+{\sigma}-{\alpha}-\beta-{\gamma}})}{\Gamma({{\sigma}-{\alpha}})\Gamma({{\sigma}-\beta})\Gamma({{\sigma}-{\gamma}})}. \end{align*}$

Several examples of such formulae are

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_m^3( \frac 12)_n^2}{m!n!(m+n)!(m+1)!(2n+1)} = \frac 4{\pi},$

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 12)_m^3( \frac 32)_n^3}{m!n!(m+n)!(n+3)!( \frac 12)_{m+1}} = \pi,$

and

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^2( \frac 13)_n^3}{m!n!(n+1)!(2-3m)(- \frac 13)_{m+n}} = \frac {\sqrt3\pi}3.$

The remainder of the paper is organized as follows. In section 2 we give the proof of Theorem 1.3. Sections 3 and 4 are devoted to the double series expansions for $1/\pi$ and $\pi$ , respectively.

2. Proof of Theorem 1.3

First of all, by making use of (1.1), Theorem 1.3 can be restated as follows:

$\begin{equation} \begin{split} &\sum\limits_{m,n = 0}^\infty \frac {\Gamma({a+m})\Gamma({b+m})\Gamma({c+m})\Gamma({d-a+n})\Gamma({d-b+n})\Gamma({d-c+n})} {m!n!\Gamma({d+m+n})\Gamma({e+m})\Gamma({d+e-a-b-c+n})}\\ & = \frac {\Gamma(a)\Gamma(b)\Gamma(c)\Gamma({d-a})\Gamma({d-b})\Gamma({d-c})\Gamma({e-d})}{\Gamma(d)\Gamma({e-a})\Gamma({e-b})\Gamma({e-c})}. \end{split} \end{equation}$

(2.1)

From (1.1) it is easy to see that

$\begin{align*} &\Gamma({a+{\alpha}+m}) = ({\alpha})_{a+m}\Gamma({{\alpha}}), \ \Gamma({b+\beta+m}) = (\beta)_{b+m}\Gamma({\beta}),\ \Gamma({c+{\gamma}+m}) = ({\gamma})_{c+m}\Gamma({{\gamma}}),\\ &\Gamma({d-a+{\delta}-{\alpha}+n}) = ({\delta}-{\alpha})_{d-a+n}\Gamma({{\delta}-{\alpha}}),\ \Gamma({d-b+{\delta}-\beta+n}) = ({\delta}-\beta)_{d-b+n}\Gamma({{\delta}-\beta}),\\ &\Gamma({d-c+{\delta}-{\gamma}+n}) = ({\delta}-{\gamma})_{d-c+n}\Gamma({{\delta}-{\gamma}}),\ \Gamma({d+{\delta}+m+n}) = ({\delta})_{d+m+n}\Gamma({{\delta}})\\ &\Gamma({e+m+{\sigma}}) = ({\sigma})_{e+m}\Gamma({\sigma}),\ \Gamma({a+{\alpha}}) = ({\alpha})_a\Gamma({\alpha}),\ \Gamma({b+\beta}) = (\beta)_b\Gamma(\beta),\ \Gamma({c+{\gamma}}) = ({\gamma})_c\Gamma({\gamma}),\\ &\Gamma({d-a+{\delta}-{\alpha}}) = ({\delta}-{\alpha})_{d-a}\Gamma({{\delta}-{\alpha}}),\ \Gamma({d-b+{\delta}-\beta}) = ({\delta}-\beta)_{d-b}\Gamma({{\delta}-\beta}),\\ &\Gamma({d-c+{\delta}-{\gamma}}) = ({\delta}-{\gamma})_{d-c}\Gamma({{\delta}-{\gamma}}),\ \Gamma({e-d+{\sigma}-{\delta}}) = ({\sigma}-{\delta})_{e-d}\Gamma({{\sigma}-{\delta}}),\\ &\Gamma({d+{\delta}}) = ({\delta})_d\Gamma({\delta}),{\quad} \Gamma({e-a+{\sigma}-{\alpha}}) = ({\sigma}-{\alpha})_{e-a}\Gamma({{\sigma}-{\alpha}}),\\ &\Gamma({e-b+{\sigma}-\beta}) = ({\sigma}-\beta)_{e-b}\Gamma({{\sigma}-\beta}),\ \Gamma({e-c+{\sigma}-{\gamma}}) = ({\sigma}-{\gamma})_{e-c}\Gamma({{\sigma}-{\gamma}}),\\ &\Gamma({d+e-a-b-c+{\delta}+{\sigma}-{\alpha}-\beta-{\gamma}})\\& = ({\delta}+{\sigma}-{\alpha}-\beta-{\gamma})_{d+e-a-b-c}\Gamma({{\delta}+{\sigma}-{\alpha}-\beta-{\gamma}}). \end{align*}$

and we realize that $({\delta})_{d+m+n} = ({\delta})_d({\delta}+d)_{m+n}$ when $d\in \Bbb N_0.$ Replacing $(a, b, c, d, e)$ by $(a+{\alpha}, b+\beta, c+{\gamma}, d+{\delta}, e+{\sigma})$ in (2.1) and substituting above identities into the resulting equation, we get the desired result.

3. Double series expansions for $1/\pi$

In this section we will use Theorem 1.3 to prove the following double series expansion formula for $1/\pi$ .

Theorem 3.1 If $d\in \Bbb N_0, Re(e-d+1) > 0$ and $Re(d+e-a-b-c+ \frac 32) > 0,$ then

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_{(a+m,b+m,c+m,d-a+n,d-b+n,d-c+n)}} {m!n!(d+1)_{m+n}(2)_{e+m}( \frac 32)_{d+e-a-b-c+n}} = \frac {( \frac 12)_{(a,b,c,d-a,d-b,d-c)}(1)_{e-d}} {( \frac 32)_{(e-a,e-b,e-c)}}\cdot \frac 4{\pi}.$

Proof. Let $({\alpha}, \beta, {\gamma}, {\delta}, {\sigma}) = ( \frac 12, \frac 12, \frac 12, 1, 2)$ in Theorem 1.3. We find that

$\begin{align} \sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_{(a+m,b+m,c+m,d-a+n,d-b+n,d-c+n)}} {m!n!(d+1)_{m+n}(2)_{e+m}( \frac 32)_{d+e-a-b-c+n}} = \frac {( \frac 12)_{(a,b,c,d-a,d-b,d-c)}(1)_{e-d}} {( \frac 32)_{(e-a,e-b,e-c)}}\cdot \frac {\Gamma(2)\Gamma(1)\Gamma({ \frac 32})}{\Gamma^3( \frac 32)}. \end{align}$

(3.1)

Substituting $\Gamma({ \frac 32}) = \frac {\sqrt{\pi}}2$ into (3.1) we obtain the result immediately. Putting $(a, b, c) = (0, 0, 0)$ in Theorem 3.1 we get the following general double summation formula for $1/\pi$ with two free parameters.

Corollary 3.2 If $d\in \Bbb N_0, Re(e-d+1) > 0$ and $Re(d+e+ \frac 32) > 0,$ then

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_{(m,d+n)}^3} {m!n!(d+1)_{m+n}(2)_{e+m}( \frac 32)_{d+e+n}} = \frac {4( \frac 12)_d^3(1)_{e-d}}{\pi( \frac 32)_e^3}.$

Setting $d = 0$ and $e = k\in\Bbb N_0$ in Corallary 3.2 we have the following result.

Proposition 3.3 Let $k$ be a nonnegative integer. Then

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_{(m,n)}^3}{m!n!(m+n)!(m+k+1)!( \frac 32+k)_n} = \frac {4k!}{\pi( \frac 32)_k^2}.$

Example 3.1 ( $k = 0$ in Proposition 3.3).

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_m^3( \frac 12)_n^2}{m!n!(m+n)!(m+1)!(2n+1)} = \frac 4{\pi}.$

If $d = e = k\in\Bbb N_0$ in Corollary 3.2 we achieve

Proposition 3.4 Let $k$ be a nonnegative integer. Then

$\sum\limits_{m,n = 0}^\infty \frac {( \frac 12)_{(m,n+k)}^3} {m!n!(k+1)_{m+n}(m+k+1)!( \frac 32)_{n+2k}} = \frac 4{\pi(2k+1)^3}.$

If we put $k = 0$ into Proposition 3.4, then we can also get Example 3.1.

4. Double series expansions for $\pi$

In this section we will prove the following theorem, which allows us to derive infinitely double series expansions for $\pi$ .

Theorem 4.1 If $d\in \Bbb N_0, Re(e-d-{\sigma}+1) > 0$ and $Re(d+e-a-b-c+2) > 0,$ then

$\begin{align*} &\sum\limits_{m,n = 0}^\infty \frac {({\sigma}-1)_{(a+m,b+m,c+m)}({\sigma})_{(d-a+n,d-b+n,d-c+n)}} {m!n!(2{\sigma}+d-1)_{m+n}({\sigma})_{e+m}(2)_{d+e-a-b-c+n}}\\ & = \frac {({\sigma}-1)_{(a,b,c)}({\sigma})_{(d-a,d-b,d-c)}(1-{\sigma})_{e-d}}{(1)_{(e-a,e-b,e-c)}} \cdot \frac {\pi}{\sin{{\sigma}\pi}}. \end{align*}$

Proof. Let $({\alpha}, \beta, {\gamma}, {\delta}) = ({\sigma}-1, {\sigma}-1, {\sigma}-1, 2{\sigma}-1)$ in Theorem 1.3. We obtain that

$\begin{align*} &\sum\limits_{m,n = 0}^\infty \frac {({\sigma}-1)_{(a+m,b+m,c+m)}({\sigma})_{(d-a+n,d-b+n,d-c+n)}} {m!n!(2{\sigma}+d-1)_{m+n}({\sigma})_{e+m}(2)_{d+e-a-b-c+n}}\\ & = \frac {({\sigma}-1)_{(a,b,c)}({\sigma})_{(d-a,d-b,d-c)}(1-{\sigma})_{e-d}} {(1)_{(e-a,e-b,e-c)}} \cdot \frac {\Gamma({\sigma})\Gamma({1-{\sigma}})\Gamma({2})}{\Gamma^3(1)}. \end{align*}$

(4.1)

Combining $\Gamma({{\sigma}})\Gamma({1-{\sigma}}) = \frac \pi{\sin{\sigma}\pi}$ with (4.1) we get the desired result immediately. Putting $a = b = c = 0$ in Theorem 4.1 we obtain the following equation.

Corollary 4.2 If $d\in \Bbb N_0, Re(e-d-{\sigma}+1) > 0$ and $Re(d+e+2) > 0,$ then

$\sum\limits_{m,n = 0}^\infty \frac {({\sigma}-1)_m^3({\sigma})_{d+n}^3} {m!n!(2{\sigma}+d-1)_{m+n}({\sigma})_{e+m}(2)_{d+e+n}} = \frac {({\sigma})_d^3(1-{\sigma})_{e-d}}{(1)_e^3} \cdot \frac {\pi}{\sin{{\sigma}\pi}}.$

4.1. $\sigma=\frac{1}{2}$ in Corollary 4.2

Letting $\sigma=\frac{1}{2}$ in Corollary 4.2, we get the following proposition.

Proposition 4.3 If $d\in \Bbb N_0, Re(e-d+ \frac 12) > 0$ and $Re(d+e+2) > 0,$ then

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 12)_m^3( \frac 12)_{d+n}^3}{m!n!(d)_{m+n}( \frac 12)_{e+m} (2)_{d+e+n}} = \frac {( \frac 12)_d^3( \frac 12)_{e-d}}{(1)_{e}^3} \pi.$

When we set $d = 1$ and $e = k\in\Bbb N = \{1, 2, 3\ldots\}$ in Proposition 4.3 we obtain

Proposition 4.4 If $k$ is a positive integer, then

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 12)_m^3( \frac 32)_n^3}{m!n!(m+n)!(n+k+2)!( \frac 12)_{m+k}} = \frac {\pi( \frac 12)_{k-1}}{(k!)^3} .$

Example 4.1 ( $k = 1$ in Proposition 4.4).

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 12)_m^3( \frac 32)_n^3}{m!n!(m+n)!(n+3)!( \frac 12)_{m+1}} = \pi.$

4.2. $\sigma=\frac{1}{3}$ in Corollary 4.2

Putting $\sigma=\frac{1}{3}$ in Corollary 4.2, we get the following proposition.

Proposition 4.5 If $d\in \Bbb N_0, Re(e-d+ \frac 23) > 0$ and $Re(d+e+2) > 0,$ then

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^3( \frac 13)_{d+n}^3}{m!n!(d- \frac 13)_{m+n}( \frac 13)_{e+m} (2)_{d+e+n}} = \frac {2\sqrt3\pi( \frac 13)_d^3( \frac 23)_{e-d}}{3(1)_{e}^3}.$

When we set $d = 0$ and $e = k\in\Bbb N_0$ in Proposition 4.5 we obtain

Proposition 4.6 If $k$ is a nonnegative integer, then

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^3( \frac 13)_n^3}{m!n!(- \frac 13)_{m+n}( \frac 13)_{m+k}(n+k+1)!} = \frac {2\sqrt3\pi( \frac 23)_k}{3k!^3}.$

Example 4.2 ( $k = 0$ in Proposition 4.6).

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^2( \frac 13)_n^3}{m!n!(n+1)!(2-3m)(- \frac 13)_{m+n}} = \frac {\sqrt3\pi}3.$

Setting $d = e = k\in\Bbb N_0$ in Proposition 4.5, we get

Proposition 4.7 If $k$ is a nonnegative integer, then

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^3( \frac 13+k)_n^3}{m!n!(n+2k+1)!(k- \frac 13)_{m+n}( \frac 13)_{m+k} } = \frac {2\sqrt3\pi}{3k!^3}.$

Therefore, Example 4.2 can also be deduced by fixing $k = 0$ in the above equation.

Example 4.3 ( $k = 1$ in Proposition 4.7).

$\sum\limits_{m,n = 0}^\infty \frac {(- \frac 23)_m^3( \frac 43)_n^3}{m!n!(n+3)!( \frac 23)_{m+n} ( \frac 43)_m} = \frac {2\sqrt3\pi}9.$

5. Conclusions

Double series expansions for $1/\pi$ and $\pi$ with several free parameters are established and many interesting formulas are obtained. A point that should be stressed is that there is an important connection between the summation formulas for double hypergeometric functions and double series expansions for the powers of $\pi$ .

Acknowledgements

The author was partially supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (grant 19KJB110006).

Conflicts of interest

The author declares that there is no conflict of interest in this paper.

References

[1]	Boole G (1853) The Laws of Thought. In: The Mathematical Theories of Logic and Probabilities. Project Gutenberg (EBook #15114).
[2]	Calderone J (2014) 10 Big Ideas in 10 Years of Brain Science. Scientific American MIND, November 6.
[3]	Chalmers DJ (1996) The Conscious Mind: In Search for a Fundamental Theory. New York: Oxford University Press.
[4]	Dehaene S (2014) Consciousness and the Brain. In: Deciphering How the Brain Codes Our Thoughts. New York: Penguin Publishers.
[5]	Edelman G, Tononi G (2000) A universe of consciousness: How matter becomes imagination. Basic books.
[6]	LeDoux JE (2003) Synaptic self: How our brains become who we are. New York: Penguin Publishers.
[7]	LeDoux JE (2012) Evolution of human emotion: A view through fear. Prog Brain Res 195:431-442. doi: 10.1016/B978-0-444-53860-4.00021-0
[8]	Penrose R (1989) The Emperor's New Mind. New York: Oxford University Press.
[9]	Shiffman D, Fry S, Marsh Z (2012) The nature of code. D. Shiffman.
[10]	Bostrom N (2014) Superintelligence: Paths, dangers, strategies. OUP Oxford.
[11]	Zimme (2014) The New Science of the Brain. National Geographic.
[12]	McCulloch WS, Pitts W (1943) A logical calculus of the ideas immanent in nervous activity. B Math Biol 5: 115-133.
[13]	Turing AM (1950) Computing machinery and intelligence. Mind 59: 433-460.
[14]	Graves A, Wayne G, Danihelka I (2014) Neural turing machines. arXiv preprint arXiv:1410.5401
[15]	Von Neumann J (2012) The computer and the brain. 3rd ed. New Haven: Yale University Press: 66.
[16]	Jeffress LA (1951) Cerebral mechanisms in behavior; the Hixon Symposium. a. von Neumann J. The general and logical theory of automata: 1-41. b. McCullogh WS. Why the mind is in the head: 42-57.
[17]	Arbib MA (1987) Brains, Machines and Mathematics. In: Neural Nets and Finite Automata. 2nd ed. Berlin: Springer US: 15-29.
[18]	Franklin S (1995) Artificial Minds. Cambridge, MA: MIT Press.
[19]	Longuet-Higgins HC (1981) Artificial intelligence-a new theoretical psychology? Cognition 10: 197-201.
[20]	Neisser U (1963) The imitation of man by machine. Science 139: 193-197. doi: 10.1126/science.139.3551.193
[21]	Sloman A (1979) Epistemology and Artificial Intelligence: Expert Systems in the Microelectronic Age. Edinburgh: Edinburgh University Press.
[22]	Gardner H (1985) The Mind's New Science. New York: Basic Books.
[23]	Garland A (2015) Ex Machina – Movie.
[24]	Sejnowski TJ, Koch C, Churchland PS (1988) Computational neuroscience. Science 24: 1299-1330.
[25]	Russel S, Norvig P (2009) Artificial Intelligence: A Modern Approach. 3rd ed. NY: Pearson Publishers.
[26]	Aho AV (2012) Computation and computational thinking. Comput J 55: 832-835.
[27]	Guidolin D, Albertin G, Guescini M, et al. (2011) Central nervous system and computation. Quart Rev Biol 86: 265-85 doi: 10.1086/662456
[28]	Howard N (2012) Brain Language: The fundamental code unit. Brain Sci 1: 6-34.
[29]	Howard N, Guidere M (2012) LXIO: The mood detection Robopsych Brain Sci 1: 71-77.
[30]	Pockett S (2014) Problems with theories of consciousness. Front Syst Neurosci: 225.
[31]	Hirschberg J, Manning CD (2015) Advances in natural language processing. Science 349: 261-266. doi: 10.1126/science.aaa8685
[32]	Parkes DC, Wellman MP (2015) Economic reasoning and artificial intelligence. Science 349: 267-272. doi: 10.1126/science.aaa8403
[33]	Gershman SJ, Horvitz EJ, Tenenbaum JB (2015) Computational rationality: A converging paradigm for intelligence in brains, minds, and machines. Science 349: 273-278. doi: 10.1126/science.aac6076
[34]	Jordan M, Mitchell TM (2015) Machine learning: Trends, perspectives, and prospects. Science 349: 255-260. doi: 10.1126/science.aaa8415
[35]	Wu Y, Schuster M, Chen Z, et al. (2016) Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv 1609.08144.
[36]	y Cajal SR (1995) Histology of the nervous system of man and vertebrates. USA: Oxford University Press.
[37]	Garcia-Lopez P, Garcia-Marin V, FreireM (2010) The histological slides and drawing s of Cajal. Front Neuroanat 4: 9
[38]	Hebb DO (1949). The Organization of Behavior. New York: Wiley.
[39]	Kandel ER, Schwartz JH, Jessell TM, et al. (2013) Principles of Neural Science. New York: MacGraw-Hill.
[40]	Arshavsky YI (2006) "The seven sins" of the Hebbian synapse: can the hypothesis of synaptic plasticity explain long-term memory consolidation?. Prog Neurobiol 80: 99-113. doi: 10.1016/j.pneurobio.2006.09.004
[41]	Gallistel CR, KingA (2009) Memory and the Computational Brain. New York: Wiley Blackwell.
[42]	Hawkins J, Blakeslee S (2005) On Intelligence. New York: St Martin's Press.
[43]	Zador A, Koch C, Brown TH (1990) Biophysical model of a Hebbian synapse. Proc Natl Acad Sci USA 87: 6718-6722. doi: 10.1073/pnas.87.17.6718
[44]	Vizi ES, Fekete A, Karoly R, et al (2010) Non-synaptic receptors and transporters involved in brain functions and targets of drug treatment. Br J Pharmacol 160: 785-809. doi: 10.1111/j.1476-5381.2009.00624.x
[45]	Vizi E (2013) Role of high-affinity receptors and membrane transporters in non-synaptic communication and drug action in the central nervous system. Pharmacol Rev 52: 63-89.
[46]	Schmitt FO, Samson FE, Irwin LN, et al. (1969) Brain cell micro-environment. NRP Bulletin: 7.
[47]	Cserr HF (1986) The Neuronal Environment. Ann NY Acad Sci: 481.
[48]	Juliano RI, Haskill S (1993) Signal transduction from extracellular matrix. J Cell Biol 120: 577-585. doi: 10.1083/jcb.120.3.577
[49]	Vargova L, Sykova E (2014) Astrocytes and extracellular matrix in extrasynaptic volume transmission. Phil Trans R Soc B 369: 20130608. doi: 10.1098/rstb.2013.0608
[50]	Giaume C, Oliet S (2016) Introduction to the special issue: Dynamic and metabolic interactions between astrocytes and neurons. Neuroscience 323: 1-2. doi: 10.1016/j.neuroscience.2016.02.062
[51]	Hrabětová S, Nicholson C (2007) Biophysical properties of brain extracellular space explored with ion-selective microelectrodes, integrative optical imaging and related techniques. In: Michael AC, Borland LM, editors. Electrochemical Methods for Neuroscience. Boca Raton, FL: CRC Press: chapter 10.
[52]	Kuhn TS (1970) The Structure of Scientific Revolutions. 2nd ed. Chicago, IL: University of Chicago Press.
[53]	Landauer R (1996) The physical nature of information. Physics Letters A 217: 188-193. doi: 10.1016/0375-9601(96)00453-7
[54]	Chua LO (2011) Resistance switching memories are memristors. Applied Physics A 102: 765-783.
[55]	Di Ventra M, Pershin YY (2011) Memory materials: A unifying description. Mater Today 14: 584-591. doi: 10.1016/S1369-7021(11)70299-1
[56]	Kamalanathan D, Akhavan A, Kozicki MN (2011) Low voltage cycling of programmable metallization cell memory devices. Nanotechnology 22: 254017.
[57]	Tian F, Jiao D, Biedermann F, et al. (2012) Orthogonal switching of a single supramolecular complex. Nat Commun 3: 1207. doi: 10.1038/ncomms2198
[58]	Sakata Y, Furukawa S, Kondo M, et al. (2013) Shape-memory nanopores induced in coordination frameworks by crystal downsizing. Science 339: 193-196. doi: 10.1126/science.1231451
[59]	Lin WP, Liu S, Gong T, et al. (2014) Polymer-based resistive memory materials and devices. Adv Mater 26: 570-606. doi: 10.1002/adma.201302637
[60]	Zhou X, Xia M, Rao F, et al. (2014) Understanding phase-change behaviors of carbon-doped Ge₂Sb₂Te₅ for phase-change memory application. ACS Appl Mater Interfaces 6: 14207-14214. doi: 10.1021/am503502q
[61]	Agnati LF, Fuxe K (2014) Extracellular-vesicle type of volume transmission and tunnelling-nanotube type of wiring transmission add a new dimension to brain neuro-glial networks. Philos Trans R Soc Lond B Biol Sci 369: pii: 20130505.
[62]	Fuxe K, Borroto-Escuela DO, Romero-Fernandez W, et al. (2013) Volume transmission and its different forms in the central nervous system. Chin J Integr Med 19: 323-329. doi: 10.1007/s11655-013-1455-1
[63]	Fuxe L, Borroto-Escuela DO (2016) Volume transmission and receptor-receptor interactions in heteroreceptor complexes: Understanding the role of new concepts for brain communication. Neural Regen Res 11: 1220-1223. doi: 10.4103/1673-5374.189168
[64]	Fodor JA (1975) The Language of Thought. Boston, MA: Harvard University Press.
[65]	Sloman A, Croucher M (1981) Why robots will have emotions. Sussex University.
[66]	Mayer JD (1986) How mood influences cognition. Advances in Cognitive Science 1: 290-314.
[67]	Salovey P, Mayer JD (1990) Emotional intelligence. Imagination, Cognition and Personality 9: 285-311.
[68]	Goleman D (1995) Emotional Intelligence. New York: Bantam Books.
[69]	Valverdu J, Casacuberta D (2009) Handbook of Research on Synthetic Emotions and Sociable Robotics: New Applications in Affective Computing and Artificial Intelligence. Information Science Reference. New York: Hershey.
[70]	Meyer JJ, Dastani MM (2010) The logical structure of emotions. Dutch Companion project grant nr: IS053013. SIKS Dissertation Series No. 2010-2.
[71]	Hasson C (2011) Modelisation des mecanismes emotionnels pour un robot autonome: perspective developpementale et sociale. PhD Thesis, Universite de Cergy Pontoise, France.
[72]	Meshulam M, Winter E, Ben-Shakhar G, et al. (2011). Rational emotions. Soc Neurosci 1: 1-7.
[73]	Steunebrink BR. The Logical structure of emotions. Utrecht University, 2010.
[74]	Steunebrink BR, Dastani M, Meyer JJC (2012) A formal model of emotion triggers: an approach for BDI agents. Synthese 185: 83-129. doi: 10.1007/s11229-011-0004-8
[75]	Bosse T, Broekens J, Dias J, et al. (2014) Emotion Modeling. Towards Pragmatic Computational Models of Affective Processes. New York: Springer.
[76]	a. Hudlicka E. From habits to standards: Towards systematic design of emotion models and affective architecture: 3-23.
[77]	b. Dastani M, Floor C. Meyer JJ. Programming agents with emotions: 57-75.
[78]	c. Lowe R, Kiryazov K, Utilizing emotions in autonomous robots: An enactive approach: 76-98.
[79]	76. Smailes D, Moseley P, Wilkinson S (2015) A commentary on: Affective coding: the emotional dimension of agency. Front Hum Neurosci 9: 142.
[80]	77. Lewis M (2016) The Undoing Project: A Friendship That Changed Our Minds. New York:W.W. Norton & Co.
[81]	78. Binet A, Simon T (1916) The Intelligence of the Feeble Minded. Baltimore, MD: Williams and Wilkins.
[82]	79. Griffin D (2001) Animal Minds: Beyond Cognition to Consciousness. Chicago, IL: University Chicago Press.
[83]	80. Albuquerque N, Guo K, Wilkinson A, et al. (2016) Dogs recognize dog and human emotions. Biol Lett 12: 201508 doi: 10.1098/rsbl.2015.0883
[84]	81. Andics A, Gábor A, Gácsi M, et al. (2016) Neural mechanisms for lexical processing in dogs. Science 353:1030-1032. doi: 10.1126/science.aaf3777
[85]	82. De Waal F (2016) Are We Smart Enough To Know How Smart Animals Are? New York: WW Norton & Co.
[86]	83. Kekecs Z, Szollosi A, Palfi B, et al. (2016). Commentary: Oxytocin-gaze positive loop and the coevolution of human-dog bond. Front Neurosci 10:155.
[87]	84. Kovács K, Kis A, Kanizsár O, et al. (2016) The effect of oxytocin on biological motion perception in dogs (Canis familiaris). Animal Cogn 19: 513-522. doi: 10.1007/s10071-015-0951-4
[88]	85. Wasserman EA (2016). Thinking abstractly like a duck(ling). Science 353: 222-223.
[89]	86. Wynne CDL (2004) Do Animals Think? New Jersey: Princeton University Press.
[90]	87. Levy S (1993) Artificial Life. New York: Random House.
[91]	88. Marx G, Gilon C (2012) The molecular basis of memory. ACS Chem Neurosci 3: 633-642. doi: 10.1021/cn300097b
[92]	89. Marx G, Gilon C (2013) The molecular basis of memory. MBM Pt 2: The chemistry of the tripartite mechanism. ACS Chem Neurosci 4: 983–993.
[93]	90. Marx G, Gilon C (2014) The molecular basis of memory. MBM Pt 3: Tagging with neurotransmitters (NTs). Front Neurosci 3: 58.
[94]	91. Marx G, Gilon C (2016) The molecular basis of neural memory. MBM Pt 4: The brain is not a computer. "Binary" computation versus "multinary" mentation. Neuroscience and Biomedical Engineering 4: 14-24.
[95]	92. Marx G, Gilon C (2016) The Molecular Basis of Neural Memory Part 5: Chemograhic notations from alchemy to psycho-chemistry. In Press.
[96]	93. Marx G, Gilon C (2016) The molecular basis of neural memory. MBM Pt 6: Chemical coding of logical and emotive modes. Int J Neurology Res 2: 259-268.
[97]	94. Asimov I (1950) I, Robot. New York: Gnome Press.
[98]	95. Waldrop MM (1992) Complexity: The Emerging Science at the Edge of Order and Chaos. New York: Viking Penguin Group.
[99]	96. Freedman DH (1) Brainmakers. New York: Touchstone Press.
[100]	97. Maass W, Joshi P, Sontag ED (2007) Computational aspects of feedback in neural circuits. PLoS Comput Biol 3: e165.
[101]	98. Picard RW, Vyzas E, Healey J (2001) Toward machine emotional intelligence: Analysis of affective physiological state. IEEE transactions on pattern analysis and machine intelligence 23: 1175-1191. doi: 10.1109/34.954607
[102]	99. Hirschberg J, Manning CD (2015) Advances in natural language processing. Science 349: 261-266.
[103]	100. Critique of Pure Reason (1781) Translated by Norman Kemp Smith. London Macmillan 1934.
[104]	101. Sloman A (2008) Kantian philosophy of mathematics and young robots. In: Proceedings 7th International Conference on Mathematical Knowledge Management Birmingham, UK, July 28-30. Available from: http://events.cs.bham.ac.uk/cicm08/mkm08/.
[105]	102. Berto F (2010). There's Something about Gödel: The Complete Guide to the Incompleteness Theorem. New York: John Wiley and Sons.
[106]	103. Ryle G (1949) The Concept of Mind. UK: Penguin Books.

Reader Comments

Your name:*

Email:*
© 2017 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)