Subrecursive programming languages. II. On program size (Q2546770)

From MaRDI portal

Revision as of 03:25, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

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

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Subrecursive programming languages. II. On program size	scientific article

Statements

scholarly article

0 references

Subrecursive programming languages. II. On program size (English)

0 references

Journal of Computer and System Sciences

0 references

publication date

1971

0 references

Robert L. Constable

0 references

MaRDI profile type

MaRDI publication profile

0 references

Iteration of Primitive Recursion

0 references

On the size of machines

0 references

A Machine-Independent Theory of the Complexity of Recursive Functions

0 references

On the Length of Programs for Computing Finite Binary Sequences

0 references

A Hierarchy of Primitive Recursive Functions

0 references

0 references

0 references

Random-Access Stored-Program Machines, an Approach to Programming Languages

0 references

0 references

On the Computational Complexity of Algorithms

0 references

0 references

Recursive Properties of Abstract Complexity Classes

0 references

Computer programming and formal systems

0 references

Classes of computable functions defined by bounds on computation

0 references

0 references

0 references

Primitive recursive functions

0 references

0 references

Some definitional suggestions for automata theory

0 references

Computability of Recursive Functions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(71)80039-9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2546770

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2546770&oldid=34537679"