Complexity of Fractran and Productivity (Q5191114): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 20:52, 1 July 2024

scientific article; zbMATH DE number 5587951

Language	Label	Description	Also known as
English	Complexity of Fractran and Productivity	scientific article; zbMATH DE number 5587951

Statements

scholarly article

0 references

Complexity of Fractran and Productivity (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-02959-2_28

0 references

Jörg Endrullis

0 references

Clemens Grabmayer

0 references

Dimitri Hendriks

0 references

Automated Deduction – CADE-22

0 references

publication date

28 July 2009

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.1007/978-3-642-02959-2_28

0 references

0 references

Termination of term rewriting using dependency pairs

0 references

Degrees of Undecidability in Term Rewriting

0 references

Complexity of Fractran and Productivity

0 references

Productivity of Stream Definitions

0 references

The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)

0 references

Strong Computability and Variants of the Uniform Halting Problem

0 references

0 references

The Undecidability of the Generalized Collatz Problem

0 references

The 3x + 1 Problem and Its Generalizations

0 references

0 references

Equality of streams is a Π0 over 2-complete problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5191114

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