Combinatorial-State Automata and Models of Computation
  • 분야
  • 저자
  • 발행기관
  • 간행물정보
  • 파일형식
  •  
  • 구매가격
  • 적립금
이메일 발송  스크랩 하기
자료 다운로드  네이버 로그인
영문초록
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.
사업자등록번호 220-87-87785 대표.신현웅 주소.서울시 서초구 방배로10길 18, 402호 대표전화.070-8809-9397
개인정보책임자.박정아 통신판매업신고번호 제2017-서울서초-1765호 이메일 help@reportshop.co.kr
copyright (c) 2009 happynlife. steel All reserved.