Computable Models

DOI10.1007/978-1-84882-052-4zbMATH Open1166.68028OpenAlexW4242926226MaRDI QIDQ3528043FDOQ3528043

Authors: Raymond Turner 

Publication date: 2 October 2008

Full work available at URL: https://doi.org/10.1007/978-1-84882-052-4

Recommendations

• Computable Models
• scientific article; zbMATH DE number 1450824
• scientific article; zbMATH DE number 225477
• Algebraic computability and enumeration models. Recursion theory and descriptive complexity
• Computability and computable models

zbMATH Keywords

SpecificationData TypesAxiomatic TheoriesComputer ModellingFormal OntologyProgramming Language Semantics

Mathematics Subject Classification ID

Data structures (68P05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cited In (9)

• On the Computational Capabilities of Several Models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model-based computation
• Computable Models
• A new spectrum of computable models
• Imperatives: a judgemental analysis
• Computability of homogeneous models
• Type-theoretic logic with an operational account of intensionality

This page was built for publication: Computable Models

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