Pages that link to "Item:Q1325710"

The following pages link to Dynamical system where proving chaos is equivalent to proving Fermat's conjecture (Q1325710):

Displaying 6 items.

• The incompleteness of theories of games (Q1277328) (← links)
• Undecidable Hopf bifurcation with undecidable fixed point (Q1893895) (← links)
• Undecidability, incompleteness and Arnol'd problems (Q1896752) (← links)
• Fermat's last theorem and chaoticity (Q2629932) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• The complexity of proving chaoticity and the Church–Turing thesis (Q5251233) (← links)