cartesian product

Stuff about computing…mostly

Menu

Skip to content
  • Home
  • About
    • My PhD research
  • Binsic Is Not Sinclair Instruction Code

If only I had the time…

Standard
April 6, 2014

I would reimplement BINSIC using a JIT compiler as outlined in this rather good blog from Josh Haberman.

(And, at least now I have bumped Chomsky from the top of my blog.)

Rate this:

Share this:

  • Google
  • Twitter
  • Print
  • Facebook
  • Tumblr
  • Email
  • Pinterest
  • Reddit
  • LinkedIn
  • Pocket

Like this:

Like Loading...

Related

BASIC BINSIC compilers JIT JIT compilers Josh Haberman

Post navigation

← It seems Chomsky was right (and what it might mean?)
OPT and LRU compared for multithreaded code →

Tag cloud

Alan Turing Algorithm algorithms Android Apple astronomy BASIC BINSIC Birkbeck C++ Climate change Computability computer science computing conways game of life Cosmology demand paging Domain-specific language Education free software General relativity GitHub Global warming Google Groovy Hex editor Java Languages LaTeX Linux Linux kernel London LRU LyX Master of Science mathematics maths Memory management MetaPost Microblaze Microsoft Moon Network-on-Chip New Scientist Operating system Operating Systems page replacement Page replacement algorithm Perl PhD Physics programming P versus NP problem Quantum mechanics Raspberry Pi relational algebra Relational database science Software development Soviet Union Spam SQL TeX turing machine Ubuntu Unity Universal Credit University of York Unix Valgrind virtual memory working set XML XSLT zx80
stats for wordpress
Blog at WordPress.com.
loading Cancel
Post was not sent - check your email addresses!
Email check failed, please try again
Sorry, your blog cannot share posts by email.
%d bloggers like this: