Back to Results
First PageMeta Content
Constant folding / Graph / Matching / Applied mathematics / Mathematics / Theoretical computer science / Graph theory


Occam’s Razor in Metacomputation: the Notion of a Perfect Process Tree Robert Glück1 Andrei V. Klimov2 Institut für Computersprachen University of Technology Vienna A-1040 Vienna, Austria
Add to Reading List

Document Date: 2010-10-22 08:04:53

Open Document

File Size: 48,14 KB

Share Result on Facebook

City

Vienna / Moscow / Copenhagen / Bondorf / /

Country

Denmark / /

/

Facility

Austria Keldysh Institute of Applied Mathematics Russian Academy / University of Copenhagen / Klimov2 Institut für Computersprachen University of Technology / /

IndustryTerm

concise and clear algorithms / clear and concise driving algorithms / separate pre-processing phase / naive algorithm / /

Organization

Russian Academy of Sciences / Austria Keldysh Institute / University of Copenhagen / für Computersprachen University of Technology Vienna A-1040 Vienna / Russian Foundation for Fundamental Research / Austrian Science Foundation / /

Person

Andrei V / Treemix / /

/

Position

applicable partial evaluator / partial evaluator / S-Graph interpreter / interpreter / /

ProgrammingLanguage

Haskell / Occam / Lisp / /

Technology

functional programming / naive algorithm / rather clear and concise driving algorithms / concise and clear algorithms / /

SocialTag