There are several natural questions arising from giving a group by its presentation. The word problem asks whether two words are effectively the same group element. By relating the problem to Turing machines, one can show that there is in general no algorithm solving this task. Another, generally harder, algorithmically insoluble problem is the group isomorphism problem, which asks whether two groups given by different presentations are actually isomorphic
چه حکایت از فراقت که نداشتم ولیکن...ما را در سایت چه حکایت از فراقت که نداشتم ولیکن دنبال میکنید
برچسب: نویسنده: بازدید: 138