#noindex [[Srch:,recursion]] recursion n. WtEn:recursion recursive adj. ? WtEn:recursive <> = Sub = == recursive call 재귀호출 == [[재귀호출,recursive_call]] - [[호출,call]] =재귀호출,recursive_call =,recursive_call 재귀호출 recursive_call Srch:recursive_call Srch:재귀호출 { WtEn:recursive_call Ndict:재귀호출 Ggl:재귀호출 Bing:재귀호출 Ggl:"recursive call" "recursive call" } == recursive function 재귀함수 == [[재귀함수,recursive_function]] =재귀함수,recursive_function 재귀함수,recursive_function 재귀함수 recursive_function Srch:재귀함수 Srch:recursive_function { WtEn:recursive_function 이건 basic programming의 뜻과 CS의 좀 까다로운 뜻 두가지가 있는데, pagename? / page division? REL [[함수,function]] [[펑션,function]] Twins: https://namu.wiki/w/재귀함수 Ndict:재귀함수 Ggl:재귀함수 Bing:재귀함수 Ggl:"recursive function" "recursive function" } == recursive definition 재귀적 정의 == [[recursive_definition]] =,recursive_definition =,recursive_definition . recursive_definition { recursive definition 재귀정의? 재귀적정의? WtEn:recursive_definition inductive_definition 과 동의어라고. curr at [[정의,definition]] 맨위 Ndict:재귀적정의 Ggl:재귀적정의 Bing:재귀적정의 Ggl:"recursive definition" } == head_recursion vs tail_recursion == head_recursion tail_recursion "head recursion tail recursion" Naver:"head recursion tail recursion" Ggl:"head recursion tail recursion" QQQ 머리재귀에 비해 꼬리재귀는 컴파일러가 최적화할 수 있어 더 효율적? 항상? CHK === head recursion 머리재귀 ?? === [[head_recursion]] =,head_recursion =,head_recursion . head_recursion head recursion WtEn:head_recursion === tail recursion 꼬리재귀 ? === [[tail_recursion]] =,tail_recursion =,tail_recursion . tail_recursion { tail recursion WtEn:tail_recursion ? WtEn:tail_recursive ? adj. ? 꼬리재귀 외의 마땅한 번역이 없나? WpSp:tail_recursion ? WpEn:tail_recursion ? Ndict:"tail recursion" x [[Date(2023-09-19T08:20:16)]] Ndict:꼬리재귀 x [[Date(2023-09-19T08:20:16)]] Naver:꼬리재귀 Bing:꼬리재귀 Ggl:꼬리재귀 꼬리재귀 "tail recursion" } ==== 꼬리재귀 최적화 ==== PAGENAME TBD "tail recursion elimination optimization" Naver:"tail recursion elimination optimization" Ggl:"tail recursion elimination optimization" Bing:"tail recursion elimination optimization" "꼬리재귀 최적화" Naver:"꼬리재귀 최적화" Ggl:"꼬리재귀 최적화" Bing:"꼬리재귀 최적화" Up: [[최적화,optimization]] > { [[code_optimization]] / [[compiler_optimization]] } == recursion theorem == recursion_theorem "recursion theorem" Ggl:"recursion theorem" === Kleene's recursion theorem === Kleene's recursion theorem "Kleene's recursion theorem" [[계산가능함수,computable_function]] [[계산가능펑션,computable_function]] https://en.wikipedia.org/wiki/Kleene's_recursion_theorem ... Ggl:"Kleene's recursion theorem" == ADDHERE (SUB pages of recursion) == == ADDHERE (SUB pages of recursion) == == ADDHERE (SUB pages of recursion) == == ADDHERE (SUB pages of recursion) == == ADDHERE (SUB pages of recursion) == = 관련표현 = self-reference 스스로를 [[참조,reference]] wk 표제어가 자기언급이었나... WpKo:자기언급 .... Naver:자기언급+자기참조 하는 건 '''재귀'''와 밀접한데... 저건 [[프랙털,fractal]]과도 밀접. 자기언급 자기참조 self-definition ? 이런게있나? recursive_definition 과 차이가 있다면? 같은건지? Ggl:self-definition Ggl:"self-definition recursive definition" ''사실 self 뭐뭐 이건 모두 재귀와밀접한데...'' = 동의어 = 계산가능성 얘기할 땐, '''recursive''' = computable 동의어. mathematical_induction (VG: 수학적귀납법,mathematical_induction) 얘기할 땐, '''recursive''' = inductive 동의어. ''언젠 또 iterative와 동의어였던것갈은데 뭐였지... [[반복,iteration]]'' ''이것 정리 tbw'' https://en.wikipedia.org/wiki/Mathematical_logic#Recursion_theory "Recursion theory, also called computability theory, studies..." [[recursion_theory]] = [[computability_theory]] 동의어. = Cmp = recurrence - [[recurrence]] - [[리커런스,recurrence]] 저것도 재귀로 번역되기도 하는데 저건 [[점화,]]로 할까? (VG: 점화식,recurrence_relation => [[점화관계,recurrence_relation]] 예정.) [[iterative_method]] { [[반복,iteration]] [[방법,method]]? } = Twin = [[WpKo:재귀_(컴퓨터_과학)]] https://simple.wikipedia.org/wiki/Recursion Ggl:재귀+recursion Bing:재귀+recursion Ndict:재귀+recursion