Blum axioms - PDFSEARCH.IO - Document Search Engine

Blum axioms
Results: 9

#	Item
1	A Formal Evaluation of DepDegree Based on Weyuker’s Properties Dirk Beyer Peter Häring Add to Reading List Source URL: www.sosy-lab.org Language: English - Date: 2014-04-12 06:14:35 Complexity Science Blum axioms Structure Weighted Micro Function Points Programming complexity Software metrics Theoretical computer science Cyclomatic complexity
2	From: To: Subject: Date: Eken, Ziya Add to Reading List Source URL: www.bis.org Language: English - Date: 2010-04-19 07:27:00 Financial economics Credit rating agency Probability measure Systemic risk Complexity Blum axioms Financial risk Economics Risk
3	How Efficient can Memory Checking be? Cynthia Dwork1 , Moni Naor2,? , Guy N. Rothblum3,?? , and Vinod Vaikuntanathan4,? ? ? 1 2 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-02-04 10:07:19 Applied mathematics L Complexity Time complexity Blum axioms FO Theoretical computer science Computational complexity theory Complexity classes
4	Statistical Learning of Arbitrary Computable Classifiers David Soloveichik California Institute of Technology Department of Computation and Neural Systems MC[removed]Pasadena, CA 91125 Add to Reading List Source URL: www.dna.caltech.edu Language: English - Date: 2009-05-26 19:56:02 Computational learning theory Computability theory Theory of computation Machine learning Probably approximately correct learning Blum axioms Computable function Uniform convergence VC dimension Theoretical computer science Mathematics Applied mathematics
5	Thoughts on the OTS December 2012 document on a complexity index Richard Baron, Institute of Directors, [removed] 1. There are some questions to ask at the outset. 1.a. What is to have its complexity measured Add to Reading List Source URL: www.gov.uk Language: English - Date: 2013-05-01 06:14:14 Complex systems theory Systems Abstraction Complexity Holism Computational complexity theory Blum axioms FO SO Theoretical computer science Applied mathematics Finite model theory
6	The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed] Add to Reading List Source URL: www.cs.unibo.it Language: English - Date: 2007-10-31 03:46:45 Mathematics Theory of computation Blum axioms Computable function ELEMENTARY Recursively enumerable set Smn theorem Computational complexity theory Lambda calculus Theoretical computer science Computability theory Applied mathematics
7	GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-15 20:06:55 Mathematics Computer science Computable function Recursive set Computation in the limit Generic-case complexity Turing reduction Halting problem Blum axioms Computability theory Theoretical computer science Theory of computation
8	Order Notation in Practice Roger Orr OR/2 Limited What does complexity measurement mean? Add to Reading List Source URL: accu.org Language: English - Date: 2014-04-14 04:21:09 Analysis of algorithms Mathematical notation Asymptotic analysis Big O notation Structural complexity theory Blum axioms Logarithm HO Function Theoretical computer science Mathematics Computational complexity theory
9	Annales Mathematicae et Informaticae[removed]pp. 29–44 http://ami.ektf.hu Complexity metric based source code transformation of Erlang programs∗ Add to Reading List Source URL: ami.ektf.hu Language: English - Date: 2013-12-20 14:03:26 Holism Computer programming Cyclomatic complexity Erlang Complexity Control flow Software quality Code refactoring Blum axioms Software metrics Software engineering Computing