The following pages link to (Q4946095):
Displaying 15 items.
- Algebraic structures computable without delay (Q528478) (← links)
- Computable isomorphisms of Boolean algebras with operators (Q694494) (← links)
- The algebraic structure of the isomorphic types of tally, polynomial time computable sets (Q1407537) (← links)
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Punctual copies of algebraic structures (Q2186304) (← links)
- Graphs are not universal for online computability (Q2186809) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Atomless Boolean algebras computable in polynomial time (Q2402149) (← links)
- Is there a logic for polynomial time? (Q4255975) (← links)
- <i>P</i> ≠ <i>NP</i> for all infinite Boolean algebras (Q4804182) (← links)
- Boolean complexity classes vs. their arithmetic analogs (Q4894604) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
