不可判定问题列表 目录 逻辑問題 抽象電腦(Abstract machine)問題 矩陣問題 組合群論(combinatorial group theory)問題 拓扑学問題 可解答性問題 其它問題 參考 导航菜单An Undecidable Property of Definite Integrals

数学列表計算理論递归论計算複雜性理論


[1]




這是一個不可判定问题列表




目录





  • 1 逻辑問題


  • 2 抽象電腦(Abstract machine)問題


  • 3 矩陣問題


  • 4 組合群論(combinatorial group theory)問題


  • 5 拓扑学問題


  • 6 可解答性問題


  • 7 其它問題


  • 8 參考




逻辑問題



  • 大衛·希爾伯特的可判定性。

  • 二階Λ演算的类型推论和型別檢查。


抽象電腦(Abstract machine)問題



  • 停机问题(決定圖靈機是否停機)

  • 決定圖靈機是否Busy beaver(最長運行的圖靈機有相用的停机问题)


  • 死亡率问题(mortality problem)


  • 萊斯定理指出所有partial方程的非凡屬性,決定機器計算partial方程與其屬性是否未決定。


矩陣問題


  • 矩陣的致命問題:表達,一個有限集合的n × n矩陣的整數項,是否能有規律地倍增,重複出現,生成零矩陣。(已知一組15個或更多的3 × 3的矩陣及2組的45 × 45矩陣是未決定問題)

  • 決定一個有限集合的上三角形3 × 3矩陣與非負整數項能否組成一個自由半群。

  • 決定兩個有限生成的Mn(Z)子半群是否有相同的元素。


組合群論(combinatorial group theory)問題


  • Word problem for groups

  • 共軛問題


  • 群同構問題(Group isomorphism problem)


拓扑学問題


  • 決定兩個有限單形(simplicial complex)是否表現同胚空間。

  • 決定兩個有限單形(simplicial complex)是否(同胚至)流形。

  • 決定有限單的基本群是否密着。


可解答性問題


  • 對於某些類別的方程,問題決定;兩個相用的方程,零的方程,是否不定積分的函數也包括在其中。例如,請參考Stallworth and Roush[1]。(這些問題並非總是不可判定的。這取決於class。例如,Risch algorithm,一个对于属于超越初等函数一个领域,其任何函数的初等积分之有效决定步骤。)

  • “分解問題決定the definite contour multiple integral of an elementary meromorphic function is zero over an everywhere real analytic manifold on which it is analytic。”這被希爾伯特第十問題判定為矛盾而解決。[2]


其它問題



  • 波斯特对应問題(Post correspondence problem)

  • 某些形式語言的word problem

  • 決定王氏砖块是否能铺满平面

  • 判断標記系統是否停机

  • 计算某个字符串的柯氏复杂性


  • 希爾伯特第十問題:決定不定方程(又稱為丟番圖方程)的可解答性。

  • 決定上下文有关语言会否生成对应字母表的所有字符串;或判断其是否有歧义。

  • 兩個上下文有关语言能否生成同樣的字符串,或一個语言生成另一個语言生成的子集,或是否有某个字符串两个语言都生成。

  • 給予一個為初始點的有理坐標是週期性,決定位於basin of attraction是否開集,或是否在平分線函數迭代為兩個綱比或三個綱比。

  • 決定Λ演算方程是否有正則形式。


參考



  1. ^ Stallworth, Daniel T. and Fred W. RoushAn Undecidable Property of Definite Integrals Proceedings of the American Mathematical Society Volume 125, Number 7, July 1997, Pages 2147-2148


  2. ^ S&R

Brookshear, J. Glenn. Theory of Computation: Formal Languages, Automata, and Complexity. Redwood City, California: Benjamin/Cummings Publishing Company, Inc. 1989.  Appendix C includes impossibility of algorithms deciding if a grammar contains ambiguities, and impossibility of verifying program correctness by an algorithm as example of Halting Problem.


Halava, Vesa. Decidable and undecidable problems in matrix theory. TUCS technical report 127. Turku Centre for Computer Science. 1997. 
[1]


B. M. E. Moret, H. D. Shapiro. Algorithms from P to NP, volume 1 - Design and Efficiency. Redwood City, California: Benjamin/Cummings Publishing Company, Inc. 1991.  Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."


Weinberger, Shmuel. Computers, rigidity, and moduli. Princeton, NJ: Princeton University Press. 2005.  Discusses undecidability of the word problem for groups, and of various problems in topology.







Popular posts from this blog

名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar