#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1974

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Journals and Conferences

Learn More

- Julian V. Noble
- Nature
- 1974

- Julian V. Noble
- Computing in Science and Engineering
- 2000

few problems lend themselves to closed-form solution, we often need to convert formal definitions into practical numerical methods. One such problem deals with the Principal Value integral, which many students encounter in a course on functions of a complex variable. However, the prospect of evaluating one numerically might seem rather daunting. To the best… (More)

- Julian V. Noble
- SIGPLAN Notices
- 2002

The April 2000 issue of ACM SIGPLAN Notices contained several articles that touched directly or indirectly on finite state machines (FSMs). In Fortran and Basic the computed GOTO provides a direct, if cumbersome, method for constructing state machines. Languages with CASE or SWITCH provide a more structured route. When none of these is available, FSMs may… (More)

- Julian V. Noble
- Computing in Science and Engineering
- 2002

- Julian V. Noble
- Computing in Science and Engineering
- 2003

- Julian V. Noble
- 2006

Forth is a language that, for most programmers, is like the back side of the Moon: they know it is there but have never laid eyes on it. Yet Forth is mature (about as old as Lisp or C); ubiquitous in everyday applications such as automated tellers, package tracking, airline reservations, telephone switching systems, and microcontrollers everywhere; and… (More)

- Julian V. Noble
- Computing in Science & Engineering
- 2007

This installment of computing prescriptions illustrates how complex arithmetic can simplify algorithms in two-dimensional Cartesian vector space as well as how to make difficult numerical integrals tractable. In other words, computer languages for scientific applications should support complex arithmetic.

- Julian V. Noble
- FORTH '92
- 1993

" Abstract Forth provides an extremely fast, flexible platform for rule-based programming. In particular, Forth has made possible a telegraphic notation for determirustic finite state machines based on compiling the state transition table. That is, ESMs in Forth can be made self-documenting. The ease of writing FSMs makes practical a virtually decisionless… (More)

- Julian V. Noble
- 2003

It’s no fun to program complex arithmetic in a language that doesn’t support it. Worse, the resulting code is cumbersome, opaque, and hard to maintain. In this column I illustrate how complex arithmetic simplifies algorithms in two-dimensional Cartesian vector space. I also show how straying into the complex plane can make difficult numerical integrals… (More)

- Julian V. Noble
- Computing in Science and Engineering
- 2002

76 1521-9615/02/$17.00 © 2002 IEEE COMPUTING IN SCIENCE & ENGINEERING years ago1). So, a word of self-introduction is in order. Back in the summer of 1960, while interning at Grumman Aircraft, I was assigned to learn the new language Fortran so that I could program the company’s brand-new IBM 704. The rules of engagement were arcane—you wrote out the… (More)

- ‹
- 1
- ›