#noindex
##=====추상기계,abstract_machine =,abstract_machine 추상기계 abstract_machine
'''abstract machine'''


[[기계,machine]] - mentioned
[[컴퓨터,computer]] - curr at there



[[WpEn:Abstract_machine]] = https://en.wikipedia.org/wiki/Abstract_machine
 {[[Date(2023-11-06T20:18:26)]] TOC전까지:
 "In CS, an '''abstract machine''' is a theoretical_model // [[모델,model]] [[모형,model]]
 CS에서 '''추상기계'''란, 이론적 모형이다
 that allows for a detailed and precise analysis of how a computer system functions. // computer_system  WtEn:computer_system ... [[컴퓨터,computer]] 와 별도 페이지 필요할지? or 필요없을지?                           
 컴퓨터 시스템이 어떻게 기능하는지에 대한 자세하고 정확한 [[분석,analysis]]을 가능케 하는.
 It is similar to a mathematical function^^([[함수,function]])^^ in that it
 수학의 함수와 이런 점들이 비슷하다.
  receives inputs and
  입력을 받고
  produces outputs
  출력을 만들고(생산한다)
  based on predefined rules. // predefined_rule - is_a [[규칙,rule]]
  미리 정해진 규칙에 따라.

 '''Abstract machines''' vary from literal machines in that they are expected to perform correctly and independently of [[하드웨어,hardware]].
 실제 기계와는 다른 점: 완벽히 정확하게,,(correctly, [[정확성,correctness]].. curr at [[올바름,correctness]]),, 돌아가며/수행하며(perform), 하드웨어에 독립적.

 // 이름이 이런 이유:
 '''Abstract machines''' are "machines" because they allow step-by-step [[실행,execution]] of programmes;
 프로그램 실행을 한 [[단계,step]]씩(step-by-step) 할 수 있게 하므로 '기계'이다.
 they are "abstract" // linked to : [[https://en.wikipedia.org/wiki/Abstraction_(computer_science)]]
 because they ignore many aspects of actual (hardware) machines.
 실제 HW의 많은 관점을 무시하기 때문에 '추상'이다.

 A typical '''abstract machine''' consists of a definition in terms of
  input, // [[입력,input]] [[출력,output]] [[입출력,IO]]
  output, and
  the set of allowable operations // [[연산,operation]]
 used to turn the former into the latter.

 They can be used for purely theoretical reasons as well as models for real-world computer systems.
 In the theory of computation, // [[WpEn:Theory_of_computation]] = https://en.wikipedia.org/wiki/Theory_of_computation  // [[computation_theory]] ... [[계산이론,computation_theory]]? 계산론? Ggl:계산이론 Ggl:계산론 Naver:계산이론 Naver:계산론 Up: [[이론,theory]]
 '''abstract machines''' are often used in thought experiments // [[사고실험,thought_experiment]] =,thought_experiment . thought_experiment { thought experiment = WtEn:thought_experiment 사고실험 Ndict:사고실험 }
 regarding computability // [[계산가능성,computability]]이었던가  https://en.wikipedia.org/wiki/Computability .... curr at [[계산,computation]]
 or to analyse the complexity of algorithms. // [[알고리듬,algorithm]] [[복잡도,complexity]] ...( [[complexity_analysis]] [[복잡도분석,complexity_analysis]]? )

 This use of '''abstract machines''' is fundamental to the field of
 computational complexity theory, // computational complexity theory = computational_complexity_theory / [[WpEn:Computational_complexity_theory]] = https://en.wikipedia.org/wiki/Computational_complexity_theory
 such as
  finite state machines, // https://en.wikipedia.org/wiki/Finite-state_machine
  Mealy machines, // https://en.wikipedia.org/wiki/Mealy_machine
  push-down automata, and // https://en.wikipedia.org/wiki/Pushdown_automaton
  Turing machines."} // [[튜링_기계,Turing_machine]]

----
Cmp: [[가상기계,virtual_machine]]

----
Twin:

WtEn:abstract_machine ??

https://ko.wikipedia.org/wiki/추상_기계

https://www.pls-lab.org/en/Abstract_machine

...
Ggl:"abstract machine"
Ndict:"abstract machine"

----
Up:
[[추상,abstract]] [[abstraction]] [[abstractness]]
/* =,abstract =,abstraction =,abstractness */ (or WtEn:abstraction WtEn:abstractness ...? 전자는 혹시 [[추상화,abstraction]] 에 더 가까운거고 후자는 추상성?? 그래서 후자가 옳은건가? chkout 단어의미차이.(
 Ggl:"abstraction abstractness" Naver:"abstraction abstractness"
 ) ... [[abstractness]])
[[추상화,abstraction]]
[[기계,machine]]