scientific article; zbMATH DE number 4145883
From MaRDI portal
Publication:3476796
Recommendations
- scientific article; zbMATH DE number 1302875
- Estimation of the algorithmic complexity of classes of computable models
- scientific article; zbMATH DE number 3880674
- scientific article; zbMATH DE number 749929
- scientific article; zbMATH DE number 1762076
- Computable model discovery and high-level-programming approximations to algorithmic complexity
- scientific article; zbMATH DE number 804044
- Comparison theorems for algorithmic models
- On the monotone convergence of algorithmic models
- Algorithmic dimensions of homomorphic images of models
Cited in
(11)- Polynomial-time versus recursive models
- Functional trees and automorphisms of models
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
- Constructive models of regularly infinite algorithmic dimension
- scientific article; zbMATH DE number 4016877 (Why is no real title available?)
- On the Computational Capabilities of Several Models
- scientific article; zbMATH DE number 4093434 (Why is no real title available?)
- scientific article; zbMATH DE number 1302875 (Why is no real title available?)
- scientific article; zbMATH DE number 1534360 (Why is no real title available?)
- scientific article; zbMATH DE number 749929 (Why is no real title available?)
- scientific article; zbMATH DE number 804044 (Why is no real title available?)
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 Q3476796)