[[계산그래프,computational_graph]] [[계산기,calculator]] [[컴퓨터,computer]] TBD QQQ: [[계산,calculation]]과의 관계? - [[VG:연산,operation]]앞부분에서도 언급 [[계산,computing]] - [[컴퓨팅,computing]]도 계산으로 번역 가능. 저건 [[전산,computing]]으로 번역 가능할 듯 [[연산,operation]]과의 관계? compare. MKL [[산술,arithmetic]] [[계산가능성,computability]] { [[계산가능함수,computable_function]] =계산가능함수,computable_function =,computable_function 계산가능함수 computable_function { computable function WtEn:computable_function ?? https://encyclopediaofmath.org/wiki/Computable_function ... 계산가능함수 Ndict:계산가능함수 Ggl:계산가능함수 "computable function" Ndict:"computable function" Ggl:"computable function" } https://ncatlab.org/nlab/show/computability ... Google:계산가능성 Google:computability ... Naver:계산가능성 Naver:computability [[https://terms.naver.com/entry.naver?docId=4349217&cid=40942&categoryId=31530 두산백과 계산가능성 Computability]] } [[계산이론,computation_theory]] (theory of computation) - curr at [[알고리듬,algorithm]] [[계산복잡도,computational_complexity]] // curr alsoin [[알고리듬,algorithm]] TOMERGE { 계산복잡도 computational complexity 계산복잡도이론 computational complexity theory // [[complexity_theory]] [[이론,theory]] * amount of memory - storage/[[메모리,memory]]/공간/의 크기 ... rel. [[공간복잡도,space_complexity]] * number of steps - rel. [[시간복잡도,time_complexity]] MKLINK [[문제,problem]] [[알고리듬,algorithm]] [[프로그램,program]] ... Google:계산복잡도 Naver:계산복잡도 ... Google:computational+complexity Naver:computational+complexity [[복잡도,complexity]] } = model = =,model_of_computation =,computation_model . model_of_computation computation_model { model of computation computation model 계산모델 계산모형 [[계산,computation]] model([[모형,model]] [[모델,model]]) Sub: sequential model FSM finite-state_machine s finite_state_machine s ''// pagename normalization required'' finite state machine s https://en.wikipedia.org/wiki/Finite_state_machine Post machines (Post–Turing machines and tag machines) Post_machine [[Post-Turing_machine]] =,Post-Turing_machine =,Post-Turing_machine . Post-Turing_machine Post-Turing machine [[WpEn:Post–Turing_machine]] = https://en.wikipedia.org/wiki/Post–Turing_machine = https://en.wikipedia.org/wiki/Post%E2%80%93Turing_machine // 아래 셋 [[tag_machine]] = [[tag_system]] = [[Post_tag_system]] [[tag_machine]] =,tag_machine =,tag_machine . tag_machine https://en.wiktionary.org/wiki/tag_machine x 2023-11-03 [[태그,tag]]? [[tag_system]] =,tag_system =,tag_system . tag_system [[태그,tag]]? [[Post_tag_system]] =,Post_tag_system =,Post_tag_system . Post_tag_system ([[추상기계,abstract_machine]]로 볼 경우 명칭) tag system tag machine Post tag system [[Emil_Post]]가 1943년 published, as a simple form of a [[Post_canonical_system]] =,Post_canonical_system =,Post_canonical_system . Post_canonical_system { Post canonical system https://en.wikipedia.org/wiki/Post_canonical_system Ndict:"Post canonical system" Ggl:"Post canonical system" } WpEn:Tag_system = https://en.wikipedia.org/wiki/Tag_system https://mathworld.wolfram.com/TagSystem.html https://mathworld.wolfram.com/CyclicTagSystem.html [[pushdown_automaton]] =,pushdown_automaton =,pushdown_automaton . pushdown_automaton [[WtEn:pushdown_automaton]] = https://en.wiktionary.org/wiki/pushdown_automaton https://simple.wikipedia.org/wiki/Pushdown_automata x 2023-11-03 [[WpEn:Pushdown_automata]] = https://en.wikipedia.org/wiki/Pushdown_automata [[register_machine]] =,register_machine =,register_machine . register_machine [[WpEn:Register_machine]] = https://en.wikipedia.org/wiki/Register_machine RAM = random-access_machine =,random-access_machine . https://en.wikipedia.org/wiki/Random-access_machine PRAM = parallel RAM = parallel random-access machine = parallel_random-access_machine .... Srch:PRAM Turing_machine https://en.wikipedia.org/wiki/Turing_machine [[튜링_기계,Turing_machine]] decision_tree_model - [[결정트리,decision_tree]] model - https://en.wikipedia.org/wiki/Decision_tree_model functional model s abstract_rewriting_system ARS { https://en.wikipedia.org/wiki/Abstract_rewriting_system } combinatory_logic - curr at [[조합론,combinatorics]] .. [[로직,logic]]에 추가 todo - https://en.wikipedia.org/wiki/Combinatory_logic general_recursive_function https://en.wikipedia.org/wiki/General_recursive_function // 아래에 lambda calculus - [[람다대수,lambda_calculus]] 작성할동안 VG 람다대수,lambda_calculus concurrent models concurrent_model s actor_model [[actor_model]] Srch:actor_model https://en.wikipedia.org/wiki/Actor_model cellular_automaton [[cellular_automaton]] https://en.wikipedia.org/wiki/Cellular_automaton interaction_net s interaction nets https://en.wikipedia.org/wiki/Interaction_nets Ggl:"interaction nets" Kahn process networks KPN or process network process_network =,process_network . https://en.wikipedia.org/wiki/Kahn_process_networks ... Ggl:"Kahn process networks" Logic gates and digital circuits [[논리게이트,logic_gate]] [[디지털_회로,digital_circuit]] https://en.wikipedia.org/wiki/Logic_gate Petri nets ([[Petri_net]]...curr [[네트,Net#s-3]]) Synchronous Data Flow SDF https://en.wikipedia.org/wiki/Synchronous_Data_Flow Up: data_flow dataflow ... Ndict:"Synchronous Data Flow" (2023-08 자료없음. 메인으로 나가야함.) Ggl:"Synchronous Data Flow" (tmp) general_recursive_function general recursive function 일반재귀함수 ? Inter: https://en.wikipedia.org/wiki/General_recursive_function ''모두 같은 표현: "'''general recursive function, partial recursive function''', or '''μ-recursive function'''"'' //general recursive function, partial recursive function, or μ-recursive function 이것은 [[부분함수,partial_function]]. 이것이 [[total_function]]이면 '''total recursive function''' = total_recursive_function 이 되며, 가끔 그냥 '''recursive function''' = recursive_function 으로 줄여 부름. "(sometimes shortened to recursive function)" // MKL [[재귀함수,recursive_function]] [[primitive_recursive_function]] { primitive recursive function 원시재귀함수 (wk) https://ko.wikipedia.org/wiki/원시_재귀_함수 https://en.wikipedia.org/wiki/Primitive_recursive_function Ndict:"원시재귀함수" Ggl:"원시재귀함수" Ndict:"primitive recursive function" Ggl:"primitive recursive function" } 에 밀접. ... 모든 total r.f.가 primitive r.f인 것은 아님. (ex. Ackermann_function https://en.wikipedia.org/wiki/Ackermann_function ) μ는 [[minimization_operator]]. { minimization operator 최소화 연산자 / 작용소 ? [[최소화,minimization]] [[연산자,operator]] [[작용소,operator]] ... https://en.wikipedia.org/wiki/%CE%9C_operator ... Ndict:"minimization operator" (2023-08-12 없음. 전체검색으로 나가보면 vg 나옴.) Ggl:"minimization operator" Ggl:"mu operator" } corresp ko interwiki: https://ko.wikipedia.org/wiki/Μ-재귀_함수 '''μ-재귀 함수''' 한국어로? at [[Date(2023-08-13T05:29:37)]] Naver:"일반 재귀 함수" .... 거의 언급이 없다. 적절한 kw? Naver:"뮤 재귀 함수" ... https://eatchangmyeong.github.io/2022/04/22/interest-driven-mu-recursive-functions.html Naver:"μ-재귀 함수" Ggl:"일반 재귀 함수" Ggl:"뮤 재귀 함수" Ggl:"μ-재귀 함수" https://mathworld.wolfram.com/GeneralRecursiveFunction.html Ndict:"general recursive function" Ggl:"general recursive function" https://en.wikipedia.org/wiki/Model_of_computation } = theory = [[계산이론,computation_theory]] ? or 계산론? Srch:computation_theory ... https://en.wikipedia.org/wiki/Theory_of_computation http://www.aistudy.com/computer/computation.htm { 이 분야는 크게 계산가능성 이론 (computability theory) 과 계산복잡도이론 (computational complexity theory) 으로 나뉘어 있는데, 두 분야 모두 [[추상기계,abstract_machine]]를 다룬다. ||(rel.) ||성질 ||[[이론,theory]] || ||'''계산,computation'''/[[가능성,possibility]] ||[[계산가능성,computability]] ||[[계산가능성이론,computability_theory]] WtEn:computability_theory || ||'''계산,computation'''/[[복잡도,complexity]] ||[[계산복잡도,computational_complexity]] ||[[계산복잡도이론,computational_complexity_theory]] WtEn:computational_complexity_theory || } = hyper- = hypercomputation =,hypercomputation . hypercomputation { hypercomputation WtEn:hypercomputation http://pub.mearie.org/하이퍼계산 https://ko.wikipedia.org/wiki/하이퍼_계산 https://en.wikipedia.org/wiki/Hypercomputation Ndict:hypercomputation Ggl:hypercomputation Ndict:하이퍼계산 Ggl:하이퍼계산 Up: [[하이퍼,hyper]] } ---- https://en.wikipedia.org/wiki/Computation MV TO [[VG:전산학,compsci]]