Irreducible Complexity: eForth for Discovery
I will be using this book for:

Irreducible Complexity: eForth for Discovery

by Chen-Hanson Ting

Computers Programming
1 Star 2 Star 3 Star 4 Star 5 Star
0.0 out of 5 stars (0 ratings)

Irreducible Complexity: eForth for Discovery offers a focused look at eForth and its relationship to programming, computing, and discovery. Written by Chen-Hanson Ting, it is suited to readers interested in compact programming systems and technical exploration.

About This Book

Irreducible Complexity: eForth for Discovery focuses on eForth, a compact programming language and computing environment.

The book connects eForth with ideas of irreducible complexity and discovery.

It may interest readers exploring programming systems, computer science, and hands-on technical concepts.

Written by Chen-Hanson Ting, this title presents a focused examination of eForth and its role in computational exploration.

Reviews

No reviews yet. Be the first to review this book!


Write a Review
I will be using this book for: