Difference between r1.20 and the current
@@ -60,6 +60,8 @@
[[동차다항식,homogeneous_polynomial]] =동차다항식,homogeneous_polynomial =,homogeneous_polynomial . (w)
{
[[https://terms.naver.com/entry.naver?docId=5669283&cid=60207&categoryId=60207 수학백과: 동차함수]] 첫줄.
(이하 copied from local at [[Date(2023-10-18T16:51:47)]])
@@ -169,14 +171,41 @@
Turing_degree
aka "degree of unsolvability"
WtEn:Turing_degree
https://en.wikipedia.org/wiki/Turing_degree
= (Etc) Compare =
----
'''''TODO MVFROM [[degree]]'''''
aka "degree of unsolvability"
unsolvability
algorithmic_unsolvability
unsolvability =,unsolvability . unsolvability
{
(내생각대충) 해결불가능성? 해결불가성 ? 해결불능성 ? ....
algorithmic_unsolvability 와 동의어인듯
} // unsolvability ... Bing:unsolvability Naver:unsolvability Ggl:unsolvability
WtEn:Turing_degree
https://en.wikipedia.org/wiki/Turing_degree
"Turing degree (named after Alan Turing) or degree of unsolvability
of a set of natural numbers
measures the level of algorithmic unsolvability of the set."
Turing equivalence 정의함.
Turing_equivalence =,Turing_equivalence . Turing_equivalence
{
'''Turing equivalent''' adj.
'''Turing equivalence''' n.
MKL
Turing_jump https://en.wikipedia.org/wiki/Turing_jump .... Turing_jump_operator Turing_jump_operation
"Two sets are Turing equivalent if they have the same level of unsolvability" ( WpEn:Turing_degree#Overview )
https://en.wikipedia.org/wiki/Turing_degree#Turing_equivalence
Up: [[동치,equivalence]]? or 동등성?
}// Turing equivalence ... Naver:"Turing equivalence" Ggl:"Turing equivalence" Bing:"Turing equivalence"
Alan_Turing
= (Etc) Compare =
[[오더,order]]랑 어떤 관계지?
[[오더,order]]랑 어떤 관계지? 대충은 물론 알겠는데 정확히는 글쎄... 근데 정확히 서술하는 게 가능한가? 분야에 따라 달라져서. 그럼 이건 '분야에 따른 비교표'가 최선인 듯?
----
'''''TODO MVFROM [[degree]]'''''
번역어가 너무 다양하다.
- 계수, -계 (coefficient랑 겹침)
ex. 고계 = high degree
- 차, -차, 차수 (rank랑 겹침)
- 도, -도, 정도
ex. 각도angle(각,angle을 ‘각도’라고도 한다), 온도temperature(온도 temperature 온도,temperature =온도 =,temperature 온도 ...)에서 degree의 번역은 항상 '도'가 들어가는 듯.
1. graph / network ¶
그래프,graph 그래프이론,graph_theory 네트워크,network 네트워크이론,network_theory 네트워크과학,network_science... 에서의 degree는 뭐로 번역하는게 최선인가?
저기서 degree의 뜻은 node_degree or vertex_degree. Node에 연결된 edge(s)의 수. (graph_vertex에 연결된 graph_edge의 수.)
directed_graph(=digraph)일 경우, 두 가지: indegree(in-degree), outdegree(out-degree)가 있음.
directed_graph(=digraph)일 경우, 두 가지: indegree(in-degree), outdegree(out-degree)가 있음.
기호는 deg(v)
Topics:
maximum_degree Δ(G) - 그래프 G의 degrees중 최대값.
minimum_degree δ(G) - 그래프 G의 degrees중 최소값.
degree_distribution
maximum_degree Δ(G) - 그래프 G의 degrees중 최대값.
minimum_degree δ(G) - 그래프 G의 degrees중 최소값.
degree_distribution
Degree_distribution
https://mathinsight.org/degree_distribution
degree가 큰 vertex(large-degree node)를 hub라고 한다.[1]https://mathinsight.org/degree_distribution
보면 중간에 두 그림: binomial_degree_distribution , power_law_degree_distribution
65%쯤 그림에선 marginal_degree_distribution 언급
65%쯤 그림에선 marginal_degree_distribution 언급
Twins:
https://mathworld.wolfram.com/VertexDegree.html
Degree_(graph_theory)
https://xlinux.nist.gov/dads/HTML/degree.html
https://mathworld.wolfram.com/VertexDegree.html
Degree_(graph_theory)
https://xlinux.nist.gov/dads/HTML/degree.html
2. polynomial ¶
cf. 다음 둘:
동차다항식,homogeneous_polynomial =동차다항식,homogeneous_polynomial =,homogeneous_polynomial . (w)
{
수학백과: 동차함수 첫줄.
{
수학백과: 동차함수 첫줄.
(이하 copied from local at 2023-10-19)
homogeneous_polynomial = https://en.wiktionary.org/wiki/homogeneous_polynomial
Homogeneous_polynomial = https://en.wikipedia.org/wiki/Homogeneous_polynomial
동차다항식 = https://ko.wikipedia.org/wiki/동차다항식
斉次多項式 = https://ja.wikipedia.org/wiki/斉次多項式
homogeneous polynomial
"homogeneous polynomial"
homogeneous_polynomial = https://en.wiktionary.org/wiki/homogeneous_polynomial
Homogeneous_polynomial = https://en.wikipedia.org/wiki/Homogeneous_polynomial
동차다항식 = https://ko.wikipedia.org/wiki/동차다항식
斉次多項式 = https://ja.wikipedia.org/wiki/斉次多項式
그럼 제차-는 일본어에서 들여온 번역인가?
homogeneous polynomialhomogeneous polynomial
"homogeneous polynomial"
동차함수,homogeneous_function =동차함수,homogeneous_function ? =,homogeneous_function ? (w)
{
homogeneous_function
{
homogeneous_function
(이하 copied from local at 2023-10-19)
수학백과: 동차함수
homogeneous_function
Homogeneous_function
동차함수
https://mathworld.wolfram.com/HomogeneousFunction.html
https://encyclopediaofmath.org/wiki/Homogeneous_function
이것에 대한 오일러의 정리 : https://mathworld.wolfram.com/EulersHomogeneousFunctionTheorem.html
수학백과: 동차함수
homogeneous_function
Homogeneous_function
동차함수
https://mathworld.wolfram.com/HomogeneousFunction.html
https://encyclopediaofmath.org/wiki/Homogeneous_function
이것에 대한 오일러의 정리 : https://mathworld.wolfram.com/EulersHomogeneousFunctionTheorem.html
See also : 수학백과: 동차식 (1.동차함수) 에서 노란색 박스, 혹은 페이지에서 "오일러의 동차함수 정리" 검색
동차함수 = https://namu.wiki/w/동차함수Degree two인 homogeneous polynomial/function(2차 동차다항식/동차함수)는 이차형식,quadratic_form과 밀접 - tbw 명확히.
그리고 다음도 cf. (모두 local에 =,homogeneous =,homogeneity =,homogeneousness (RR page: 동차성,homogeneity) 저기에 순서대로)
3. degree of freedom, dof ¶
degree of freedom
degree_of_freedom
자유도
degree_of_freedom
자유도
MKLINK VG : 자유도,degree_of_freedom
page fork to 자유도,degree_of_freedom ?? or 자유도,freedom_degree,DoF ???
page fork to 자유도,degree_of_freedom ?? or 자유도,freedom_degree,DoF ???
degree_of_freedom = https://en.wiktionary.org/wiki/degree_of_freedom
{ 대충보기 at 2023-11-13
1. (물리/고전역학 쪽, 기계에 대해)
2. (열역학계, ..에 대해. 열역학,thermodynamics/화학 쪽)
{ 대충보기 at 2023-11-13
1. (물리/고전역학 쪽, 기계에 대해)
2. (열역학계, ..에 대해. 열역학,thermodynamics/화학 쪽)
열역학상태,thermodynamic_statedddddddddd
}5. Turing degree ¶
Turing_degree
aka "degree of unsolvability"
aka "degree of unsolvability"
unsolvability =,unsolvability . unsolvability
{
(내생각대충) 해결불가능성? 해결불가성 ? 해결불능성 ? ....
{
(내생각대충) 해결불가능성? 해결불가성 ? 해결불능성 ? ....
algorithmic_unsolvability 와 동의어인듯
Turing_degree
https://en.wikipedia.org/wiki/Turing_degree
https://en.wikipedia.org/wiki/Turing_degree
"Turing degree (named after Alan Turing) or degree of unsolvability
of a set of natural numbers
measures the level of algorithmic unsolvability of the set."
Turing equivalence 정의함.
Turing_equivalence =,Turing_equivalence . Turing_equivalence
{
Turing equivalent adj.
Turing equivalence n.
MKL
Turing_jump https://en.wikipedia.org/wiki/Turing_jump .... Turing_jump_operator Turing_jump_operation
"Two sets are Turing equivalent if they have the same level of unsolvability" ( Turing_degree#Overview )
https://en.wikipedia.org/wiki/Turing_degree#Turing_equivalence
Up: 동치,equivalence? or 동등성?
}// Turing equivalence ... Turing equivalence Turing equivalence Turing equivalence
Alan_Turingof a set of natural numbers
measures the level of algorithmic unsolvability of the set."
Turing equivalence 정의함.
Turing_equivalence =,Turing_equivalence . Turing_equivalence
{
Turing equivalent adj.
Turing equivalence n.
MKL
Turing_jump https://en.wikipedia.org/wiki/Turing_jump .... Turing_jump_operator Turing_jump_operation
"Two sets are Turing equivalent if they have the same level of unsolvability" ( Turing_degree#Overview )
https://en.wikipedia.org/wiki/Turing_degree#Turing_equivalence
Up: 동치,equivalence? or 동등성?
}// Turing equivalence ... Turing equivalence Turing equivalence Turing equivalence
----
- [1] "These large-degree nodes are often referred to as hubs," https://mathinsight.org/degree_distribution