http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Combinatorial-State Automata and Models of Computation
( Curtis Brown ) 서울대학교 인지과학연구소 2012 Journal of Cognitive Science Vol.13 No.1
David Chalmers has defended an account of what it is for a physical system to implement a computation. The account appeals to the idea of a "combinatorial-state automaton" or CSA. It is not entirely clear whether Chalmers intends the CSA to be a full-blown computational model, or merely a convenient formalism into which instances of other models can be translated. I argue that the CSA is not a computational model in the usual sense because CSAs do not perspicuously represent algorithms, and because they are too powerful both in that they can perform any computation in a single step and in that without so far unspecified restrictions they can "compute" the uncomputable. In addition, I suggest that finite, inputless CSAs have trivial implementations very similar to those they were introduced to avoid.
Curtis Brian,Seruga Jan Korea Association of Information Systems 2005 情報시스템硏究 Vol.14 No.3
A comparison between various proposals for the provision of certified email is presented. In order to place the proposals in context, an outline of the basic principles of secure email is provided, as far as possible separating the issues of confidentiality, integrity and authenticity.