Sequence-to-sequence recursiveness (Q1219273)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sequence-to-sequence recursiveness	scientific article

Statements

scholarly article

0 references

Sequence-to-sequence recursiveness (English)

0 references

zbMATH Open document ID

0 references

10.1016/0020-0190(75)90050-2

0 references

Andrea Maggiolo-Schettini

0 references

Giorgio Germano

0 references

Information Processing Letters

0 references

publication date

1975

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(75)90050-2

0 references

0 references

ITERATION AND RECURSION

0 references

0 references

A flow diagram composition of Markov's normal algorithms without concluding formulas

0 references

Equivalence of partial recursivity and computability by algorithms without concluding formulas

0 references

0 references

Proving a compiler correct: A simple approach

0 references

0 references

0 references

Revised report on the algorithmic language ALGOL 60

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1219273

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