不可解

If you tried to solve the equations for the balloon's crazy flitter, its path would be nonlinear, therefore almost unsolvable, and therefore unforeseeable.

如果你试图用方程来解决气球那疯狂的飞舞运动，你会发现它的路径是非线性的，因此几乎是不可解的，这就导致了它的不可预测性。

When the graph Г′ is not connected, Our results are as following: if G is non-solvable then G is a Frobenius group; and if G is solvable then 2≤nl ≤4 for Fitting height nl of G.

我们给出了Γ′不连通时有限群G的结构：当G不可解时，G只能是Frobenius群；而当G可解时，也有2≤nl≤4。

Turing Machines, A Brief Introduction to the Undecidability, Intractability and Complexity of Problems.

图灵机，问题的不可解性、难解性和复杂性等计算理论初步知识。

Using the index arrays to discuss the operation of necklace word .construct a sovable subalgebra of NQ,which is not nilpotent.

当箭图中有长度大于1的循环，且无圈时，构造了N_Q的非可解子代数，从而证明了N_Q是不可解李代数。

The third part of this paper aims to study the global solvability or nonsolvability of a semilinear parabolic equation with singular potential.

论文的第三部分是对带奇异项的半线性抛物方程的整体可解性和不可解性的研究。

Mathematics Not solvable for the unknowns by the same set of values.

不可解的：同一系列值的情况下由于有未知数而无解的。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

The paper introduces several important notions such as uncountability and halting problem firstly,the fact is proved by contradiction that halting problem is impossible problem,and the same to other relative issues in computer is proved by reduction.

本文先介绍了不可数性和停机问题等重要概念，用反证法证明了停机问题是不可解的，并使用归约法对计算机中的相关问题的不可解性进行了证明。

This paper discusses the drawing of hyperbola normal through a point outside the hyperbola and points out the unsolvability of geometric drawing method and the unintegrality of optimization method.

对过双曲线外一定点的法线作图问题作了探讨，提出了几何作图法的不可解性及优化法解的不全性。

This paper presents a one- way trapdoor function based on the favorable properties of ergodic matrices, then implements their applications in secret- key cryptography, hybrid cryptography, STS Protocol and Shamir Three-Pass Protocol.

单单研究单向函数是没有意义的，没有什么方法能够算出它，但是如果在单向函数中加一个条件，使得原先不可解的函数变为可解，那么对于加密就有重要的意义。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。