Skip to content

Opening book details…

About this Computer Science article

Decidability And Universality In The Axiomatic Theory Of Computability And Algorithms by BURGIN, MARK is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
BURGIN, MARK
Publisher
World Scientific Publishing Company; World Scientific ; World Scientific Publishing Co; World Scientific Pub Co Pte Lt (ISSN 0129-0541)
Published
2012
Field
Computer Science (Physical Sciences)

More by BURGIN, MARK

Browse all works by BURGIN, MARK