Computability

Results: 1315



#Item
911Recursion / Programming idioms / Subroutines / Computability theory / Theory of computation / Tower of Hanoi / Tail call / Computer programming / Software engineering / Computing

8 Practical Recursion: the Leap of Faith When people first meet the idea of recursive procedures, they almost always think there is some sort of magic involved. “How can that possibly work? That procedure uses

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-12-25 23:45:06
912Programming idioms / Theoretical computer science / Mathematical logic / Computability theory / Logo / Recursion / Subroutine / Elf / Elves / Computer programming / Software engineering / Computing

9 How Recursion Works The last two chapters were about how to write recursive procedures. This chapter is about how to believe in recursive procedures, and about understanding the process by which

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-12-25 23:45:48
913Computability theory / Theoretical computer science / Function / Logo / Recursion / Regular expression / Substitution cipher / CAL Actor Language / Computable function / Computer programming / Software engineering / Mathematics

11 Recursive Operations So far, the recursive procedures we’ve seen have all been commands, not operations. Remember that an operation is a procedure that has an output rather than an effect. In

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-12-25 21:47:54
914Computability theory / Low

MCTC_TAZ_SEData_Workshop_v7Final Compiled.xlsx

Add to Reading List

Source URL: www.ncdot.gov

Language: English - Date: 2013-04-11 13:22:25
915Playing card / Calculator / Computability theory / Theory of computation / Mathematics / Functions and mappings / Function

Microsoft Word - PFAentire2.doc

Add to Reading List

Source URL: www.doe.virginia.gov

Language: English - Date: 2012-04-30 14:51:40
916Programming idioms / MedDRA / Pharmacology / Theory of computation / Computability theory / Recursion / SAS / Macro / Somerset Airport / Computer programming / Computing / Software engineering

PharmaSUG[removed]Paper BB09 Processing MedDRA SMQs: Using Recursive Programming to Handle Hierarchical Data Structures Paul Stutzman, Axio Research, Seattle, WA ABSTRACT

Add to Reading List

Source URL: www.pharmasug.org

Language: English - Date: 2013-05-05 15:17:20
917Computational complexity theory / Computability theory / Random oracle / Advantage / Oracle machine / Oracle Database / Low / Oracle Corporation / IP / Cryptography / Theoretical computer science / Applied mathematics

Time-Lock Puzzles in the Random Oracle Model Mohammad Mahmoody1 , Tal Moran2 , and Salil Vadhan?2 1 Department of Computer Science, Cornell University [removed]; http://www.cs.cornell.edu/˜mohammad/

Add to Reading List

Source URL: people.seas.harvard.edu

Language: English - Date: 2011-06-17 11:55:54
918Complexity classes / Circuit complexity / Computability theory / Cryptography / Obfuscation / Obfuscated code / Algorithm / Oracle machine / Semantic security / Theoretical computer science / Computational complexity theory / Applied mathematics

On the (Im)possibility of Obfuscating Programs (Extended Abstract) Boaz Barak1 , Oded Goldreich1 , Rusell Impagliazzo2 , Steven Rudich3 , Amit Sahai4 , Salil Vadhan5 , and Ke Yang3 1

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2006-11-25 00:57:23
919Models of computation / Computability theory / Turing machine / Automata theory / Computable function / Computability / Computational complexity theory / Oracle machine / Finite-state machine / Theoretical computer science / Theory of computation / Mathematics

PDF Document

Add to Reading List

Source URL: media.wiley.com

Language: English - Date: 2014-05-16 07:14:52
920Theoretical computer science / Functions and mappings / Recursion / Theory of computation / Primitive recursive function / Function / Μ-recursive function / Course-of-values recursion / Computability theory / Mathematics / Mathematical logic

Recursive definitions are familiar in mathematics. For instance, the function f defined by f (0) = 1, f (1) = 1, f (x + 2) = f (x + 1) + f (x), gives the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, . . . . (The study of di

Add to Reading List

Source URL: www.ctan.org

Language: English - Date: 2013-12-20 19:14:22
UPDATE