Books in Analysis of algorithms and problem complexity

31-37 of 37 results in All results

Morphogenesis

• 1st Edition
• Volume 3
• November 26, 1992
• P.T. Saunders
• English
• Hardback 978-0-444-88486-2

  9 7 8 - 0 - 4 4 4 - 8 8 4 8 6 - 2
• eBook 978-0-08-093405-1

  9 7 8 - 0 - 0 8 - 0 9 3 4 0 5 - 1

The collected works of Turing, including a substantial amount of unpublished material, will comprise four volumes: Mechanical Intelligence, Pure Mathematics, Morphogenesis and Mathematical Logic. Alan Mathison Turing (1912-1954) was a brilliant man who made major contributions in several areas of science. Today his name is mentioned frequently in philosophical discussions about the nature of Artificial Intelligence. Actually, he was a pioneer researcher in computer architecture and software engineering; his work in pure mathematics and mathematical logic extended considerably further and his last work, on morphogenesis in plants, is also acknowledged as being of the greatest originality and of permanent importance. He was one of the leading figures in Twentieth-century science, a fact which would have been known to the general public sooner but for the British Official Secrets Act, which prevented discussion of his wartime work. What is maybe surprising about these papers is that although they were written decades ago, they address major issues which concern researchers today.

Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

• 1st Edition
• Volume 51
• June 26, 1992
• J. Nešetril + 1 more
• English
• eBook 978-0-08-086791-5

  9 7 8 - 0 - 0 8 - 0 8 6 7 9 1 - 5

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.

Mechanical Intelligence

• 1st Edition
• Volume 1
• January 30, 1992
• D.C. Ince
• English
• Hardback 978-0-444-88058-1

  9 7 8 - 0 - 4 4 4 - 8 8 0 5 8 - 1

The collected works of Turing, including a substantial amount of unpublished material, will comprise four volumes: Mechanical Intelligence, Pure Mathematics, Morphogenesis and Mathematical Logic. Alan Mathison Turing (1912-1954) was a brilliant man who made major contributions in several areas of science. Today his name is mentioned frequently in philosophical discussions about the nature of Artificial Intelligence. Actually, he was a pioneer researcher in computer architecture and software engineering; his work in pure mathematics and mathematical logic extended considerably further and his last work, on morphogenesis in plants, is also acknowledged as being of the greatest originality and of permanent importance. He was one of the leading figures in Twentieth-century science, a fact which would have been known to the general public sooner but for the British Official Secrets Act, which prevented discussion of his wartime work. What is maybe surprising about these papers is that although they were written decades ago, they address major issues which concern researchers today.

Pure Mathematics

• 1st Edition
• Volume 2
• January 30, 1992
• J.L. Britton
• English
• Hardback 978-0-444-88059-8

  9 7 8 - 0 - 4 4 4 - 8 8 0 5 9 - 8

The collected works of Turing, including a substantial amount of unpublished material, will comprise four volumes: Mechanical Intelligence, Pure Mathematics, Morphogenesis and Mathematical Logic. Alan Mathison Turing (1912-1954) was a brilliant man who made major contributions in several areas of science. Today his name is mentioned frequently in philosophical discussions about the nature of Artificial Intelligence. Actually, he was a pioneer researcher in computer architecture and software engineering; his work in pure mathematics and mathematical logic extended considerably further and his last work, on morphogenesis in plants, is also acknowledged as being of the greatest originality and of permanent importance. He was one of the leading figures in Twentieth-century science, a fact which would have been known to the general public sooner but for the British Official Secrets Act, which prevented discussion of his wartime work. What is maybe surprising about these papers is that although they were written decades ago, they address major issues which concern researchers today.

Self-Modifying Systems in Biology and Cognitive Science

• 1st Edition
• Volume 6
• March 20, 1991
• G. Kampis
• English
• eBook 978-0-08-091239-4

  9 7 8 - 0 - 0 8 - 0 9 1 2 3 9 - 4

The theme of this book is the self-generation of information by the self-modification of systems. The author explains why biological and cognitive processes exhibit identity changes in the mathematical and logical sense. This concept is the basis of a new organizational principle which utilizes shifts of the internal semantic relations in systems. There are mathematical discussions of various classes of systems (Turing machines, input-output systems, synergetic systems, non-linear dynamics etc), which are contrasted with the author's new principle. The most important implications of this include a new conception on the nature of information and which also provides a new and coherent conceptual view of a wide class of natural systems. This book merits the attention of all philosophers and scientists concerned with the way we create reality in our mathematical representations of the world and the connection those representations have with the way things really are.

Planar Graphs

• 1st Edition
• Volume 32
• April 1, 1988
• T. Nishizeki + 1 more
• English
• eBook 978-0-08-086774-8

  9 7 8 - 0 - 0 8 - 0 8 6 7 7 4 - 8

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

Symbolic Logic and Mechanical Theorem Proving

• 1st Edition
• May 28, 1973
• Chin-Liang Chang + 1 more
• English
• Hardback 978-0-12-170350-9

  9 7 8 - 0 - 1 2 - 1 7 0 3 5 0 - 9
• eBook 978-0-08-091728-3

  9 7 8 - 0 - 0 8 - 0 9 1 7 2 8 - 3

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.