The following pages link to Thomas H. Payne (Q1149432):
Displaying 13 items.
- (Q673675) (redirect page) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- General computability (Q1149433) (← links)
- Computability on finite linear configurations (Q1211505) (← links)
- Concrete computability (Q1215619) (← links)
- Effective extendability and fixed-points (Q2552127) (← links)
- Sorting X + Y (Q4060389) (← links)
- Sequences Having an Effective Fixed-Point Property (Q4081222) (← links)
- Some properties of large filters (Q4732472) (← links)
- An elementary submodel never preserved by skolem expansions (Q5590790) (← links)
- Effectively Minimizing Effective Fixed-Points (Q5639706) (← links)
- On the Existence of Fixed Points in a Totally Ordered Set (Q5645459) (← links)
- Visualising the pattern of long‐term genotype performance by leveraging a genomic prediction model (Q6051676) (← links)