Pages that link to "Item:Q2383632"
From MaRDI portal
The following pages link to On the metamathematics of the P vs. NP question (Q2383632):
Displaying 11 items.
- A note on da Costa-Doria ``exotic formalizations'' (Q711567) (← links)
- Complexity classes as mathematical axioms (Q731212) (← links)
- Informal versus formal mathematics (Q885512) (← links)
- How to build a hypercomputer (Q1036529) (← links)
- Consequences of an exotic definition for \(\text{P}=\text{NP}\). (Q1412482) (← links)
- What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) (Q1679951) (← links)
- Is there a simple, pedestrian arithmetic sentence which is independent of ZFC? (Q1840967) (← links)
- On the metamathematics of the P vs. NP question (Q2383632) (← links)
- Some thoughts on hypercomputation (Q2497877) (← links)
- Asking the Metaquestions in Constraint Tractability (Q4973888) (← links)
- (Q6042346) (← links)