Turing-Completeness of Polymorphic Stream Equation Systems

DOI10.4230/LIPICS.RTA.2012.256zbMATH Open1437.68064OpenAlexW2293641398MaRDI QIDQ5111910

Florent Balestrieri, Christian Sattler

Publication date: 27 May 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3497/pdf/20.pdf

zbMATH Keywords

recursionstream functionsTuring-completeness

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) Other nonclassical models of computation (68Q09)

Related Items (1)

Characterizing polynomial time complexity of stream programs using interpretations

This page was built for publication: Turing-Completeness of Polymorphic Stream Equation Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111910)