scientific article; zbMATH DE number 3458598
From MaRDI portal
Publication:4044553
zbMATH Open0293.02026MaRDI QIDQ4044553FDOQ4044553
Authors: Klaus Weihrauch 
Publication date: 1974
Title of this publication is not available (Why is that?)
Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)
Cited In (10)
- Some undecidability results for non-monadic Church-Rosser Thue systems
- Axiomatizing resource bounds for measure
- A recursive and a grammatical characterization of the exponential-time languages
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
- Finite complete rewriting systems and the complexity of word problem
- About the descriptive power of certain classes of finite string-rewriting systems
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups
- Classes of regular and context-free languages over countably infinite alphabets
- On primitive recursive wordfunctions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044553)
