MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Computable setModel of computationGeneral recursive functionTheory of computationAlgorithmRecursive languageFunction problemConstant-recursive sequenceIndex setProbabilistically checkable proofTime complexityIterative methodPseudo-polynomial timeComputable numberComplexity functionLoop dependence analysisHalting problemRecursionCycle detectionCircuitFunction typeBrute-force searchLoop invariantCircuit complexityComputational problemMutual recursionRecursive definitionInteger complexityFibonacci search techniqueRecursively enumerable languageProbabilistic turing machineAlgorithmic information theoryOperadAckermann functionFixed-point iterationSpace complexityRoot-finding algorithmsLoop optimizationCartesian treePotential methodComputer algebraPattern languageMaximum satisfiability problemCurryingParameterized complexityAverage-case complexityFixed-point theoremsLoopAutomatic differentiationReductionProperty testingOverlapping subproblemsCircular primePspace-completePolynomial codeGeometric progressionQuantum circuitPcp theoremElementary functionExpspaceDecision tree modelSearch problemIndex calculus algorithmExponentiation by squaringRegular languageSet-builder notationMetaheuristicLongest increasing subsequenceIterated binary operationPolytope modelConvergencePower iterationBoolean expressionComputational modelAnamorphismContinuous functionGeneration of primesP-completeReal computationFormal proofTrapdoor functionIterated logarithmStrong np-completenessFixed-point combinatorComputationPolynomialNl-completeAmortized analysisContinued fractionAll-pairs testingProbability-generating functionSubmodular set functionNumerical analysisInteger programmingFormal verificationSieve of sundaramFunctional analysisPrime-counting functionAlgebraic data typeClosed-form expression