scientific article

From MaRDI portal

Revision as of 21:16, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3916018

Jump to:navigation, search

zbMath0464.68038MaRDI QIDQ3916018

Carl H. Smith

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

programming languages fixed point theorem inductive inference synthesis of programs translation of programs abstract complexity measures Kleene recursion theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Abstract data types; algebraic specification (68Q65) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

On p-creative sets and p-completely creative sets

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3916018&oldid=17581478"