decidable

1000	undecidable
675	enumerable
625	solvable
613	polynomial
612	computable
591	NP
573	deterministic
554	recursive
549	Boolean
548	recursively

previous:	DeCicco
next:	decide
random:	Raviscanina

More distant neighbors

finite PSPACE Turing satisfiability algebraic recursion theorems combinatorial isomorphism axioms theorem quadratic Diophantine Godel nontrivial boolean predicate countable integers tractable arithmetic satisfies ZFC reducible polynomials factorization integer generalization Hilbert finitely solving computability decidability algebra isomorphic probabilistic subsets Banach Riemann

Back